Control Structures in Programming Languages Last Updated : 12 Jul, 2025 Comments Improve Suggest changes 54 Likes Like Report Control Structures are just a way to specify flow of control in programs. Any algorithm or program can be more clear and understood if they use self-contained modules called as logic or control structures. It basically analyzes and chooses in which direction a program flows based on certain parameters or conditions. There are three basic types of logic, or flow of control, known as: Sequence logic, or sequential flow Selection logic, or conditional flow Iteration logic, or repetitive flow Let us see them in detail: Sequential Logic (Sequential Flow) Sequential logic as the name suggests follows a serial or sequential flow in which the flow depends on the series of instructions given to the computer. Unless new instructions are given, the modules are executed in the obvious sequence. The sequences may be given, by means of numbered steps explicitly. Also, implicitly follows the order in which modules are written. Most of the processing, even some complex problems, will generally follow this elementary flow pattern. Sequential Control flow Selection Logic (Conditional Flow) Selection Logic simply involves a number of conditions or parameters which decides one out of several written modules. The structures which use these type of logic are known as Conditional Structures. These structures can be of three types: Single AlternativeThis structure has the form: If (condition) then: [Module A] [End of If structure] Implementation: C/C++ if statement with Examples Java if statement with Examples Double AlternativeThis structure has the form: If (Condition), then: [Module A] Else: [Module B] [End if structure] Implementation: C/C++ if-else statement with Examples Java if-else statement with Examples Multiple AlternativesThis structure has the form: If (condition A), then: [Module A] Else if (condition B), then: [Module B] .. .. Else if (condition N), then: [Module N] [End If structure] Implementation: C/C++ if-else if statement with Examples Java if-else if statement with Examples In this way, the flow of the program depends on the set of conditions that are written. This can be more understood by the following flow charts: Double Alternative Control Flow Iteration Logic (Repetitive Flow) The Iteration logic employs a loop which involves a repeat statement followed by a module known as the body of a loop. The two types of these structures are: Repeat-For Structure This structure has the form: Repeat for i = A to N by I: [Module] [End of loop] Here, A is the initial value, N is the end value and I is the increment. The loop ends when A>B. K increases or decreases according to the positive and negative value of I respectively. Repeat-For Flow Implementation: C/C++ for loop with Examples Java for loop with Examples Repeat-While Structure It also uses a condition to control the loop. This structure has the form: Repeat while condition: [Module] [End of Loop] Repeat While Flow Implementation: C/C++ while loop with Examples Java while loop with Examples In this, there requires a statement that initializes the condition controlling the loop, and there must also be a statement inside the module that will change this condition leading to the end of the loop. Comment S skylags Follow 54 Improve S skylags Follow 54 Improve Article Tags : Programming Language DSA Explore DSA FundamentalsLogic Building Problems 2 min read Analysis of Algorithms 1 min read Data StructuresArray Data Structure 3 min read String in Data Structure 2 min read Hashing in Data Structure 2 min read Linked List Data Structure 2 min read Stack Data Structure 2 min read Queue Data Structure 2 min read Tree Data Structure 2 min read Graph Data Structure 3 min read Trie Data Structure 15+ min read AlgorithmsSearching Algorithms 2 min read Sorting Algorithms 3 min read Introduction to Recursion 14 min read Greedy Algorithms 3 min read Graph Algorithms 3 min read Dynamic Programming or DP 3 min read Bitwise Algorithms 4 min read AdvancedSegment Tree 2 min read Binary Indexed Tree or Fenwick Tree 15 min read Square Root (Sqrt) Decomposition Algorithm 15+ min read Binary Lifting 15+ min read Geometry 2 min read Interview PreparationInterview Corner 3 min read GfG160 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding Platform 6 min read Problem of The Day - Develop the Habit of Coding 5 min read Like