bubble sort

bubble  sort (버블 소트 )

1. 소스

#include <stdio.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]) /* For decreasing order use < */
      {
        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]);

  return 0;
}

2. 결과

hacker@HACKER:~/c$ gcc -o bubble_sort bubble_sort.c
hacker@HACKER:~/c$ ./bubble_sort
Enter number of elements
10
Enter 10 integers
1
2
3
4
6
9
19
20
12
12
Sorted list in ascending order:
1
2
3
4
6
9
12
12
19
20