该排序算法给出接近/大致排序越快？ [英] which sorting algorithms give near / approximate sort sooner?

问题描述

哪个排序算法产生中间排序这是很好的近似？

Which sorting algorithms produce intermediate orderings which are good approximations?

所谓良好的近似我的意思是，根据指标，如Kendall的tau和Spearman的footrule确定如何远的有序列表是从另一个（在这种情况下，确切的那种）

By "good approximation" I mean according to metrics such as Kendall's tau and Spearman's footrule for determining how "far" an ordered list is from another (in this case, the exact sort)

具体应用我心目中是一个人类都在做主观两两比较，未必能做到所有的 N日志ñ的通过，需要比较说，堆排序还是最好的情况快速排序。

The particular application I have in mind is where humans are doing subjective pairwise comparison and may not be able to do all n log n comparisons required by, say, heapsort or best-case quicksort.

哪些算法比其他人更好地获得名单的近/近似排序越快？

Which algorithms are better than others at getting the list to a near / approximate sort sooner?

推荐答案

您可能想看看外壳排序算法。

You may want to check out the shell sort algorithm.

AFAIK它是唯一的算法，你可以用一个比较主观的使用（这意味着你不会有关于中值左右任何提示），将获得更接近正确的排序在每通。

AFAIK it is the only algorithm you can use with a subjective comparison (meaning that you won't have any hint about median values or so) that will get nearer to the correct sort at every pass.

下面是一些更多的信息 http://en.wikipedia.org/wiki/Shell_sort

Here is some more information http://en.wikipedia.org/wiki/Shell_sort

这篇关于该排序算法给出接近/大致排序越快？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！