Please send me answer within 10 min!! I will rate you good for sure!! Please explain the code!! Can you please explain this C code beside every code on each line: #include int Segments = -1; int Obstacle = 0; void Loopings() { if(Obstacle > Segments) { Segments = Obstacle; } Obstacle = 0; } int main () { int RoadSegments; int u, j, k; scanf("%d", &RoadSegments); int Course[RoadSegments + 3]; for(u = 0; u < RoadSegments; u++) { scanf("%d", &Course[u]); } for(j = 0; j < RoadSegments; j++) { if(Course[j] == 0) { if(j + 1 < RoadSegments) { if(abs (Course[j - 1] - Course[j + 1]) == 0 || abs (Course[j - 1] - Course[j + 1]) == 2) { Obstacle++; } else { Obstacle++; Loopings(); Obstacle++; } } else { Obstacle++; } } else { if(u + 2 < RoadSegments) { if(abs (Course[u] - Course[u + 2]) == 0 || abs (Course[u] - Course[u + 2]) == 2) { Obstacle++; continue; } else { Obstacle += 2; Loopings(); } } else { Obstacle++; continue; } } } Loopings(); printf("%d\n", Segments); } Thank you !!

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Please send me answer within 10 min!! I will rate you good for sure!! Please explain the code!! Can you please explain this C code beside every code on each line: #include int Segments = -1; int Obstacle = 0; void Loopings() { if(Obstacle > Segments) { Segments = Obstacle; } Obstacle = 0; } int main () { int RoadSegments; int u, j, k; scanf("%d", &RoadSegments); int Course[RoadSegments + 3]; for(u = 0; u < RoadSegments; u++) { scanf("%d", &Course[u]); } for(j = 0; j < RoadSegments; j++) { if(Course[j] == 0) { if(j + 1 < RoadSegments) { if(abs (Course[j - 1] - Course[j + 1]) == 0 || abs (Course[j - 1] - Course[j + 1]) == 2) { Obstacle++; } else { Obstacle++; Loopings(); Obstacle++; } } else { Obstacle++; } } else { if(u + 2 < RoadSegments) { if(abs (Course[u] - Course[u + 2]) == 0 || abs (Course[u] - Course[u + 2]) == 2) { Obstacle++; continue; } else { Obstacle += 2; Loopings(); } } else { Obstacle++; continue; } } } Loopings(); printf("%d\n", Segments); } Thank you !!
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Topological Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education