A bubble sort on int array : Bubble Sort « Data Structure Algorithm « C / ANSI-C

1. C / ANSI-C
2. Data Structure Algorithm
3. Bubble Sort

A bubble sort on int array

  
#include <stdio.h>
#include <stdlib.h>

int main(void)
{
  int item[100];
  int a, b, t;
  int count;

  /* read in numbers */
  printf("How many numbers? ");
  scanf("%d", &count);
  
  for(a = 0; a < count; a++) 
      scanf("%d", &item[a]);

  /* now, sort them using a bubble sort */

  for(a = 1; a < count; ++a)
    for(b = count-1; b >= a; --b) {
      /* compare adjacent elements */
      if(item[ b - 1] > item[ b ]) {
        /* exchange elements */
        t = item[ b - 1];
        item[ b - 1] = item[ b ];
        item[ b ] = t;
      }
    }

  /* display sorted list */
  for(t=0; t<count; t++) printf("%d ", item[t]);

  return 0;
}

           
       

Related examples in the same category