CombSort
Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions are removed one by one. Comb Sort improves on Bubble Sort by using gap of size more than 1. The gap starts with a large value and shrinks by a factor of 1.3 in every iteration until it reaches the value 1 … More on Comb Sort
Question 1 |
What is the average case performance for Comb Sort?
(Note: 'i' in the options is the number if increments)
Ω(n2 / i) | |
Ω(n2 / 2i) | |
Ω(n2 / 4i) | |
Ω(n2 / 3i) |
Discuss it
There is 1 question to complete.
Coding practice for sorting
