버블정렬에 대해 설명해보세요.

void quicksort(int a[], int left, int right)

int i, j, m, p, t;

if(left < right)

p = a[right];

for(i=left-1, j = right; ;)

while(a[++i] < p);

while(a[--j] > p);

if(i>j)

break;

swap(&a[i], &a[j], t);

a[right] = a[i]; a[i] = p;

quicksort(a, left, j);

quicksort(a , i+1, right);

void bubble_sort(element list[], int n)

int i, j;

element next;

for(i = n-1; i > 0; i--)

for(j = 0; j < i; j++)

if(list[j] > list[j + 1]

swap(list[j], list[j + 1]);