Get Free Email Alerts-Freshers Jobs/Conferences/Lecture Notes/All Educational News. Subscribe for Latest Updates Click here or Enter your email id below Enter your Email ID:

Advertise With Us

Publish your Conference/Workshop/Training Program with us.Attract more targeted participants. We will publish all kind of student technical symposium for free of cost-Click here Click here to get Advertisement Procedure

DataStructure-Bubble sort.

#include <stdio.h>
#include <conio.h>
void main( )
{
int arr[5] = { 25, 17, 31, 13, 2 } ;
int i, j, temp ;
clrscr( ) ;
printf ( "Bubble sort.\n" ) ;
printf ( "\nArray before sorting:\n") ;
for ( i = 0 ; i <= 4 ; i++ )
printf ( "%d\t", arr[i] ) ;
for ( i = 0 ; i <= 3 ; i++ )
{
for ( j = 0 ; j <= 3 - i ; j++ )
{
if ( arr[j] > arr[j + 1] )
{
temp = arr[j] ;
arr[j] = arr[j + 1] ;
arr[j + 1] = temp ;
}
}
}
printf ( "\n\nArray after sorting:\n") ;
for ( i = 0 ; i <= 4 ; i++ )
printf ( "%d\t", arr[i] ) ;
getch( ) ;
}