Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n$^{2}$/ν(n) needs at least#R##N##R##N#n (min{log ν(n), log n} − 6)#R##N##R##N#comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log *(n) comparisons are always sufficient.
['Joachim Giesen', 'Eva Schuberth', 'Miloš Stojaković']
I am writing a research paper on a idea Approximate Sorting
[{"from": "human", "value": "I am writing a research paper on a idea Approximate Sorting"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n$^{2}$/\u03bd(n) needs at least#R##N##R##N#n (min{log \u03bd(n), log n} \u2212 6)#R##N##R##N#comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log *(n) comparisons are always sufficient."}]