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

Home
C / ANSI-C
1.assert.h
2.Console
3.ctype.h
4.Data Structure Algorithm
5.Data Type
6.Development
7.File
8.Function
9.Language Basics
10.Macro Preprocessor
11.Math
12.math.h
13.Memory
14.Pointer
15.setjmp.h
16.signal.h
17.Small Application
18.stdio.h
19.stdlib.h
20.String
21.string.h
22.Structure
23.time.h
24.wctype.h
C Tutorial
C++
C++ Tutorial
Visual C++ .NET
C / ANSI-C » Data Structure Algorithm » Bubble SortScreenshots 
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(itemb - 1> item]) {
        /* exchange elements */
        t = itemb - 1];
        itemb - 1= item];
        item= t;
      }
    }

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

  return 0;
}

           
       
Related examples in the same category
1.The Bubble Sort
2.A bigger bubble sort application
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.