Sorting Algorithms Questions
The average-case time complexity of comb sort is O(n^2/2^p), where n is the number of elements in the array and p is the number of increments used in the comb sort algorithm.