Skip to main content

c programming/ for loop in c


                                      c# programming


for loop in c







Loop in c language- c# programming


C  language mai jab kise statement ko hum  baar baar reapeat krwana chate hai to uske liye loop ka use kiya  jata hai
Loop ek type ka action statement hai
C language mai 3 type k loop hote hai

1-  While loop

2-      Do while  loop
3-      For loop

Chalo ab while loop ko  example se se smjhte hai:-
Agar mai apne  naam ko screen pe 5 baar print krwana chahta hu to mujhe ya to 5 baar printf function ka use krna padega ya 5 baar apna naam likhna padega

But agar mai baar baar likhne se bachana chahta hu toh loop ka use krte hai
main()
{
Int x;
clrscr();
scanf(“%d”,&x);
while(5>x)    
 //yaha bracket k under condition likhi jati hai agar ye condition true ho to while loop  ka block   chalega agar false ho to nhi chalega yaha maine likha hai ki agar enter kiya gya no 5 se chota hai to while ka box chalao nhi to mat chalao ek baar while ka box chal jaye to condition fir se check kri jayegi agar fir se dobara condition shi hogi to dobara while ka box chalega fir 3rd bar fir 4th baar jitni baar condition shi hogi utni baar while ka box chalega agar maine 4 enter kiya hai to 5>4 to humesha true hoga iss condition mai ye ek infinite  loop bannn jayega aur naam infinite baar print hoga jo ki hum nhi chahte ki humara program not ending program bane iss liye hum flow ko define krte hai jo maine next bracket mai define kiya hai  c# programming


{
printf(“allrounder”);
X++;
  // x++ flow hai agar hum aisa nhi likhte to naam infine baar print ho jayega iska mtlb ye hai ki jo number humne enter kiya h next time uss se 1 badkar number ki value check hogi for example maine 4 enter kiya to mera naam sirf ek baar print hoga 3 kiya to 2 baar 2 kiya to 3 baar 1 kiya to 4 baar naam print hoga kyuki jb tk while ki condition shi hai tb tk while ka box chalega
 }

Getch();
Return(0);
}


Iss tarah se while loop ka use kiya jata hai
To loop ki practice kijiye

Also visit-
Facebook;-follow us
Instagram;-follow us
twitter:- follow us




Comments

Popular posts from this blog

Vaccine Distribution Codechef December Long challenge solution 2020

 Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

Codechef February long challenge solution 2021

   Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1