| 1. | For example, bubble sort was analyzed as early as 1956.
|
| 2. | "Bubble sort " is a simple sorting algorithm.
|
| 3. | The sorting algorithm Bubble sort is an application of this fact.
|
| 4. | Bubble sort is a stable sort algorithm, like insertion sort.
|
| 5. | Typically cocktail sort is less than two times faster than bubble sort.
|
| 6. | So then I googled for C programs on bubble sort.
|
| 7. | However one cocktail sort pass should be counted as two bubble sort passes.
|
| 8. | For loops, a nice basic bubble sort would be a good exercise.
|
| 9. | The number of Bubble Sort swaps is equal to:
|
| 10. | Bubble sort also interacts poorly with modern CPU hardware.
|
