DIR Return Create A Forum - Home
       ---------------------------------------------------------
       Class Discussion
  HTML https://srm.createaforum.com
       ---------------------------------------------------------
       *****************************************************
   DIR Return to: Data Structure
       *****************************************************
       #Post#: 16--------------------------------------------------
       Bubble sorting(DATA STRUCTURE)
   DIR By: gaurav
       Date: May 2, 2019, 11:30 am
       ---------------------------------------------------------
       #include<stdio.h>
       #include<conio.h>
       void main ()
       {
       clrscr();
       int num, i, j, a[100], temp;
       printf("\tTO FIND THE LARGEST AND SMALLEST NUMBER IN AN
       ARRAY\n\n");
       printf("Enter how many number of arary do you want=>");
       scanf("%d",&num);
       for(i=0; i<num; i++)
       {
       printf("=>");
       scanf("%d",&a[ i ]);
       }
       printf("The numbers are:");
       for(i=0; i<num; i++)
       {
       printf("%d\t",a [ i ]);
       }
       //for ascending order
       for(i=0; i<num; i++)
       {
       for(j=i+1; j<num; j++)
       {
       if(a [ i ] > a [ j ])
       {
       temp = a [ i ];
       a [ i] = a [ j ];
       a [ j ] = temp;
       }
       }
       }
       printf("\n\nAscending order: ");
       for(i=0; i<num; i++)
       {
       printf("%d\t",a [ i ]);
       }
       //for descending
       for(i=0; i<num; i++)
       {
       for(j=i+1; j<num; j++)
       {
       if(a [ i ] < a [ j ])
       {
       temp = a[ i ];
       a [ i] = a [ j ];
       a [ j ] = temp;
       }
       }
       }
       printf("\nDescending order: ");
       for(i=0; i<num; i++)
       {
       printf("%d\t",a [ i ]);
       }
       getch();
       }
       *****************************************************
       Page 1 of 1