Week 5: Algorithm
analysis, searching,
sorting
void bubbleSort(int list[], int
size)
{
int
k;
int
j;
for
(k = 0; k < size-1; k++)
{
for (j = 1; j
< size-k; j++)
{
if
(list[j-1] > list[j])
{
swap(&list[j-1], &list[j]);
}
}
}
}