我遇到问题,此代码中的最后一个数字未排序。
// This is the more advanced optimzed version of bubble sort
int modifiedBubbleSortArray(int array[])
{
int swapped = 0;
do {
swapped = false;
// We specify a loop here for the sorting
for(int i=0;i<NUM_ARRAYS;i++)
{
// We specify aother loop here for the sorting
for(int j=0;j< i - 1 /* <<< here we make less comparisns on each pass each time */ ;j++)
{
// If the array i is better than j we enter this swap
if (array[j]<array[j+1])
{
// We swap here for the functions
swap(array[j], array[j+1]);
// We measure the amount of times we swap
amountOfSwaps += 1;
// If we swapped we break out of the loop
swapped = true;
}
}
}
} while (swapped);
printArray(array);
return amountOfSwaps;
}
// Here we swap values to sort them
void swap(int & value1, int & value2)
{
// We specify a temp and use it to swap
int temp=value1;
value1=value2;
value2=temp;
}