what is COMB SORT?
GIAN Tutorials
11:11 PM
COMB SORT Comb Sort is the advance form of Bubble Sort. Bubble Sort compares all the adjacent values while comb sort removes all the turtle values or small values near the end of the list. Factors affecting comb sort are: It improves on bubble sort by using gap of size more than 1. Gap starts with large value and shrinks by the factor of 1.3. Gap shrinks till value reaches 1. Complexity Algorithm Complexity Worst Case Complexity O(n 2 ) Best Case Complexity θ(n log n) Average Case Complexity Ω(n 2 /2 p ) where p is number of increments. Worst Case Space Complexity O(1) Algorithm STEP 1 START STEP 2 Calculate the gap value if gap value==1 goto step 5 else goto step 3 STEP 3 Iterate over data set and compare each item with gap item then goto step 4. STEP 4 Swap the element if require else goto step 2 STEP 5 Print the sorted array. STEP 6 STOP Program #include <stdio.h> #include <stdlib.h> int ...
