The article neither claims, nor offers any evidence, that comb sort is "just as good as quick sort"; could someone fix the title here, please? I'd guess that i

The article neither claims, nor offers any evidence, that comb sort is "just as good as quick sort"; could someone fix the title here, please? I'd guess that it probably performs about as well as Shell sort: hard to analyse, strongly dependent on the detail of how your increments are chosen, typically worse than O(n log n).