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
Int 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

  // 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


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


Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

Playlist CSES Problems set solution | searching ans sorting with code and explanation

 Playlist CSES Problems set solution- Playlist problem statement- Time limit:  1.00 s   Memory limit:  512 MB You are given a playlist of a radio station since its establishment. The playlist has a total of  n n  songs. What is the longest sequence of successive songs where each song is unique? Input The first input line contains an integer  n n : the number of songs. The next line has  n n  integers  k 1 , k 2 , … , k n k 1 , k 2 , … , k n : the id number of each song. Output Print the length of the longest sequence of unique songs. Constraints 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ k i ≤ 10 9 1 ≤ k i ≤ 10 9 Example Input: 8 1 2 1 3 2 7 4 2 Output:5 Playlist CSE S Problems set solution- Step -1 store value in hashmap so that we can check that song played before or not. step -2 make two-pointer i and j if v[i] has occurred earlier remove all element till v[i] and update length will be (i-j). Step 3- if v[i]  not occurred simply update ans by one.