排序少量元素(Sorting small numbers of elements)

 我经常发现自己处于一种我想分类少数元素的情况。 小，我的意思是3或4.我认为这样的小问题集可能是正确的，我想要使用某种类型的显式或直接方法，而不是调用排序函数。 2是微不足道的，3个元素仍然非常简单，但超过4项左右，我开始更喜欢简单的运行插入排序。 
 
 至多有多少元素可以期待编码一个inline void sort_n(int *list)的好处？ 4？ 5？ 6？ 
 
 在这个主题中， 只用3个元素对int数组进行排序，有两种解决方案可以对提供的3个元素进行排序。 一个比较多，另一个比较最小，但比较复杂。 在现代化的建筑上，它会以最快的速度出现？ 

I am often finding myself in a situation where I want to sort a small number of elements. By small, I mean 3 or 4. I am probably correct in thinking that with such small problem sets I would want to use some type of explicit or direct method rather than invoking a sort function. 2 is trivial, 3 elements is still pretty simple but above 4 items or so and I'm starting to prefer the simplicity of just running insertion sort. 
 
Up to how many elements can I expect a benefit to coding up a inline void sort_n(int *list)? 4? 5? 6? 
 
In this topic, sorting int array with only 3 elements, there are two solutions for sorting 3 elements provided. One has more comparisons while the other minimizes comparisons but is more complicated. On a modern architecture, which would come out on top for speed?

原文：https://stackoverflow.com/questions/8627177