Bubble sort
A form of sorting by exchanging that simply interchanges pairs of elements that are out of order in a sequence of passes through the file, until no such pairs exist. The method is not competitive with straight insertion.
Clicking on this step you can see the Create code learningstep of the algorithm.
Everything is awesome!
int i = ;
do {
last_swap_index = 0;
for(int j = ; j <= ; ++j) {
if(a[] > a[]) {
swap(a[], a[]);
last_swap_index = j;
}
}
i = last_swap_index;
} while (last_swap_index > );
You're awesome! No need for help!
1. Identify the cycle structure!
1. Listening
Listen carefully, and try to understand
the cycle structure that may exist in this algorithm!
2. Choosing structure
Now choose the cycle structure:
Congratulations! You've chosen the right structure!
May we continue, with watching the animation?
Oops! Sadly, that is not the right answer.
Would you like to listen again to the sounds?
