Skip to main content

While Loop with Example in C language

A set of statements may have to be repeatedly executed till a certain condition is reached, in every computer programming. In such situations (C language), we do not know exactly how many times a set of statements have to be repeated. So, naturally we need to have a condition controlled loop like in looping statements. In C language, the condition controlling is done generally by a while statement or while loop. It is also called test and do structure.

Syntax
while (exp)
{
  statement1;
  statement2;
  .
  .
  .
statementn;
}
Where

  • while -  is a reserve word or keyword
  • exp – is the expression which is evaluated to TRUE or FALSE.

Working of the while loop: 

The following sequences are carried out after executing the statements that appear just before the while loop

  • If the expression exp is evaluated to FALSE at the time of entry into the loop, the control comes out of the loop without executing the body of the loop. Later, the statements after the while loop are executed.
  • If the expression exp is evaluated to TRUE, the body of the loop is executed. After executing the body of the loop, control goes back to the beginning of the while loop and exp is again checked for TRUE or FALSE.
  • Thus, the body of the while loop is repeatedly executed as long as exp is evaluated TRUE. Once the expression exp is evaluated FALSE, the control comes out of the while loop and the statements which after the while loops are executed.

As the expression exp is evaluated to TRUE or FALSE in the beginning of the while loop, the loop is also called entry controlled or top testing loop.

If a relational expression is evaluated to TRUE, the result is 1. If a relational expression is evaluated to FALSE, the result is 0. If an arithmetic/logical/bitwise or any other expression is evaluated to non-zero value (for example 10, 999, etc) then the condition is TRUE. After evaluation, if the result is zero (0), then the condition is FALSE.

Some special forms of while loop are shown in table below:

While Loop with Example in C: Computer Programming

Algorithm: to reverse a given number

Step1:    [Input the number]
    Read : N
Step2:    [Initialize reverse number rev to 0]
    Rev = 0
Step3:    [Separate and reverse the number]
    While N !=0
        digit = N%10
        N = N/10
        Rev = rev*10+digit
    [End of while]
Step4:    [Output the reversed number]
    Write: rev
Step5:    Exit

Let N is 123, which is the give number to be reversed. In step1, N will be 12. In step2, N will be 1 and finally in step3, N is zero after separating a digit each time. So, the above three statements should be executed as long as N is not zero. Also, in step1, note that initial value of reverse is 0 and at the end of final step, reverse is 321.

Step by step Analysis
Step1:   
    Obtain 1st digit     =    123%10     = 3
    Reverse         =    0*10+3      = 3
    Separate 1st digit    =    123/10      = 12
Step2:   
    Obtain 2nd digit     =    12%10         = 2
    Reverse         =    3*10+2      = 32
    Separate 1st digit    =    12/10          = 1
Step3:   
    Obtain 3rd digit     =    1%10         = 0
    Reverse         =    32*10+1      = 321
    Separate 3rd digit    =    1/10          = 0
While Loop with Example in C: Computer Programming

C Program
main()
{
int n,revnum=0,digit;
printf("Enter any integer number here:\n");
scanf("%d",&n);
while(n!=0)
{
digit=n%10;
revnum=revnum*10+digit;
   n=n/10;
}
printf("The reverse number of %d is %d",n,revnum);
}

While Loop with Example in C: Computer Programming
The output is exactly the reverse no of input by the user.

Do-While loop in C

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …