Sorting In C

Hope you have haired about sorting , Arrange elements of an array either in ascending or descending,
order is called sorting.
we have a lot’s of sorting algorithm but here we will discuss about
1. Selection Sort
2. Bubble Sort

Selection Sort:-

Selection sort works by finding the smallest unsorted item in the list and swapping it with the item in
the current position.

The algorithm work works as follows:

1. set first position as current position.
2. Find the minimum value in the list.
3. Swap it with the value in current position.
4. Set next position as current position.
5. Respect Steps 2-4 until you reach end of list. Here we will make a program for arranging elements in ascending order.

selection-sort-in-ascending.c

#include<stdio.h>
int main()
{
int A = {5,2,1,4,3};
int i;

void Short( int [] );

Short(A);

for( i = 0 ; i < 5 ; i++ )
printf("%d  ",A[i]);

return 0;
}

void Short( int a[] )
{
int i,j,pos,min,temp;

for( j = 0 ; j < 4 ; j++)
{
pos = j;

for( i = j ; i < 5 ; i++ )        {          if ( a[pos] > a[i] )
pos = i;
}
temp = a[j];
a[j] = a[pos];
a[pos] = temp;
}
}

Output :-

1  2  3  4  5

and here is a program for arranging elements of array in descending order using Selection Sort.

selection-sort-in-discending.c

#include<stdio.h>
int main()
{
int A = {5,2,1,4,3};
int i;

void Short( int [] );

Short(A);

for( i = 0 ; i < 5 ; i++ )
printf("%d  ",A[i]);

return 0;
}

void Short( int a[] )
{
int i,j,pos,min,temp;

for( j = 0 ; j < 4 ; j++)
{
pos = j;

for( i = j ; i < 5 ; i++ )
{
if ( a[pos] < a[i] )
pos = i;
}
temp = a[j];
a[j] = a[pos];
a[pos] = temp;
}
}

Output:-

5  4  3  2  1

Bubble Sort:-

Bubble sort works by comparing two continuous items in the array.
It’s algorithm is very simple just compare adjacent element and Swap them. Let’s code a program for arranging elements of array in ascending order.

#include<stdio.h>
int main()
{
int A = {5,2,1,4,3};
int i;

void Short( int [] );

Short(A);

for( i = 0 ; i < 5 ; i++ )
printf("%d  ",A[i]);

return 0;
}

void Short( int a[] )
{
int i,j,temp;
for ( j = 0 ; j < 5 ; j++ )
{
for ( i = 0 ; i < 4 ; i ++ )
{
if ( a[i] > a[i+1] )
{
temp = a[i];
a[i] = a[i+1];
a[i+1] = temp;
}
}
}
}

Output:-

1  2  3  4  5

Let’s code a program for arranging elements of array in descending order.

#include<stdio.h>
int main()
{
int A = {5,2,1,4,3};
int i;

void Short( int [] );

Short(A);

for( i = 0 ; i < 5 ; i++ )
printf("%d  ",A[i]);

return 0;
}

void Short( int a[] )
{
int i,j,temp;
for ( j = 0 ; j < 5 ; j++ )
{
for ( i = 0 ; i < 4 ; i ++ )
{
if ( a[i] < a[i+1] )
{
temp = a[i];
a[i] = a[i+1];					a[i+1] = temp;
}
}
}
}

Output:-

5  4  3  2  1

1. Jason Braganza says:
1. kumar vipin yadav says: