Bubble Sort

Write a C program to implement Bubble Sort

#include<stdio.h>

#include<conio.h>

 int main()

{

  int array[100], n, c, d, swap;

  printf("Enter number of elements\n");

  scanf("%d", &n);

  printf("Enter %d integers\n", n);

  for (c=0; c<n; c++)

    scanf("%d", &array[c]);

  for (c=0 ; c<(n-1); c++)

  {

    for (d=0; d<n-c-1; d++)

    {

      if (array[d] > array[d+1])

      {

        swap       = array[d];

        array[d]   = array[d+1];

        array[d+1] = swap;

      }

    }

  }

  printf("Sorted list in ascending order:\n");

  for ( c = 0 ; c < n ; c++ )

     printf("%d\n", array[c]);

 getch();

  return 0;

}

DEFINITION
Bubble sort is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted,comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.