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
 

1
Question 1
What is the average case performance for Comb Sort? (Note: 'i' in the options is the number if increments)
A
Ω(n2 / i)
B
Ω(n2 / 2i)
C
Ω(n2 / 4i)
D
Ω(n2 / 3i)
CombSort    
Discuss it


There is 1 question to complete.
1

 

Coding practice for sorting

 



My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.