02/21/00
COM1100 Winter2000 Yuhong Yin
13
Function BubbleSort()
// This function will sort a given array in
ascending order
// and it will also return how many exchanges
made in the process
int BubbleSort(int list[], int size) {
int move =
0; // move will record how
many exchanges needed
//
totally, there will be size -1 passes
for(int i
= 0; i < size -1; i++) {
//in each
pass, there will be size-1 comparison
for(int j
=1; j < size; j++) {
// check
if exchange is needed
if
(list[j] < list[j-1]){
swap(list[j],
list[j-1]);
move++; }
}
}
return
move;
}