Skip to main content

Loops in C++ : What is loop and types of loop in C++?

 Loops

In computer programming, loops are used to  repeat a block of code . For example, let's say we want to show a message 1000times , Then instead of writing the print statement 1000 times, we can use a loop.


Type of loops

1. For loop
2. While loop
3. Do while loop

For loop 

For loop uses an external variable to control the execution. A for loop takes into account the
                                         

Initialization
Condition checking
Incrementation

In its syntax itself. The syntax is shown below:-
For(initialization;condition;incrememt){
//body
}

While loop 

Imagine we had to print “Hello World” 100 times or n-number of times. Would it be wise to write cout << “Hello World\n” 100 times. While loops help us automate this.

Sometimes, the loop also uses an external initialization and incrementation logic to control how many times the loop may run

In its syntax itself. The syntax is shown below:

initialization; 
While (condition) { 
//body
}

Do while loop 

Do While Loop
Do while is very similar to while loop with one difference that it is exit control loop.
That is the decision to run the loop again or not happens at the time of exit of the current loop.
While in the while loop it happens before entry in the loop.

Sometimes, the loop also uses an external initialization and incrementation logic to control how many times the loop may run

Do{ 
//body
 }while (condition); 



Instagram 👇 

For more Queries

 


 
                             

Comments

Post a Comment

Popular posts from this blog

Sorting Techniques : Selection Sort , Bubble Sort , Insertion Sort

Sorting Techniques 1. Selection Sort: Idea: The inner loop selects the minimum element in the unsorted array  and places the elements in increasing order. Time complexity: O(N 2 ) #include <iostream> using namespace std; int main() {     int n;     cin>>n;   int arr[n];    for(int i=0;i<n;i++){          cin>>arr[i];   }  for(int i=0;i<n-1;i++){       for(int j=i+1;j<n;j++){            if(arr[j]<arr[i]){                 int temp =arr[j];                  arr[j]=arr[i];             arr[i]=temp;           }           }      }for(int i=0;i<n;i++){       cout<<arr[i]<<" ";    }   return 0; } 2. Bubble Sort: Idea: ...

Time and Space complexity : What does time and space complexity mean?

 Time and Space complexity                                  Time Complexity Time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. Types of notations 1. O-notation: It is used to denote asymptotic upper bound. For a given function g(n), we denote it by O(g(n)). Pronounced as “big-oh of g of n”. It also known as worst case time complexity as it denotes the upper bound in which algorithm terminates. 2. Ω-notation: It is used to denote asymptotic lower bound. For a given function g(n), we denote it by Ω(g(n)). Pronounced as “big-omega of g of n”. It also known as best case time complexity as it denotes the lower bound in which algorithm terminates. 3. !-notation: It is used to denote the average time of a program. Comparison of functions on the basis of time complexity It follows the following order in case of time complexit...