Break:-
A break statement is used to exit from enclosing loop or switch block. During execution of a program , whenever a break statement is encountered inside a loop or switch block it takes the control of execution out from the loop or switch block and jumps to the immediate next statement after the loop or switch block.
Example:-
#include<stdio.h>
int main()
{
int i;
for(i=1;i<=10;i++)
{
if(i==6)
break;
printf("%d\n",i);
}
return 0;
}
Output:-
1
2
3
4
5
Continue:-
During the execution of the program whenever a continue statement is encountered it causes to skip the execution of subsequent statement in loop and begins the next iteration of the loop.
Example:-
#include<stdio.h>
int main()
{
int i;
for(i=1;i<=10;i++)
{
if(i==6)
continue;
printf("%d\n",i);
}
return 0;
}
Output:-
1
2
3
4
5 // 6 will not printed here
7
8
9
10
Recommended Post:
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
0 Comments