blocks|key|3203925|text|为了对数据进行排序，我今天编写了两段代码|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3203926|list.Sort();
enumerable.OrderBy(x+=>+x);++//+Occasionally+a+different+lambda+is+used|code-block|syntax|javascript|3203927|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

There are two pieces of code I write today in order to sort data

<pre><code>list.Sort();
enumerable.OrderBy(x =&gt; x); // Occasionally a different lambda is used
</code></pre>

blocks|key|1039974|text|我在一家开发工具公司工作，因此我有时需要编写新的RTL类型和例程。排序是开发人员需要的东西，所以我有时也需要编写它。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1039975|别忘了，所有的库代码都不是从高山上传下来的:某些开发人员必须在某个地方编写它。|1039976|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

I work for a developer tools company, and as such I sometimes need to write new RTL types and routines. Sorting is something developers need, so it's something I sometimes need to write.

Don't forget, all that library code wasn't handed down from some mountain: some developer somewhere had to write it.

blocks|key|1045714|text|我没有编写排序算法，但我已经在.Net中为几个类实现了IComparer，这在最初的几次中是很有趣的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1045715|在大多数情况下，考虑到框架中的内容，我不会编写排序代码。应该理解为什么像快速排序这样的特殊排序策略经常在.Net这样的框架中使用。|1045716|我可以看到给出或被给出一个排序问题，其中一些工作是实现IComparer，并理解对类进行排序的不同方法。向某人展示一个冒泡排序并问他：“为什么你不想在大多数应用程序中这样做？”|1045717|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|I|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|J|8|@]|9|@]|A|$]]|$1|F|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|G|$]]

I don't write the sorting algorithm, but I have implemented the IComparer in .Net for a few classes which was kind of interesting the first couple of times.

I wouldn't write the code for sorting given what is in the frameworks in most cases. There should be an understanding of why a particular sorting strategy like Quick sort is often used in frameworks like .Net.

I could see giving or being given a sorting question where some of the work is implementing the IComparer and understanding the different ways to sort a class. It would be a fairly easy thing to show someone a Bubble sort and ask, "Why wouldn't you want to do this in most applications?"

blocks|key|4671535|text|我可以100%25肯定地说，自从离开大学后，我还没有写过一个“传统的”排序例程。很高兴知道它背后的理论，但将它们应用于现实世界中不能通过其他方式完成的情况并不经常发生(至少从我的经验来看...)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4671536|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

I can say with 100% certainty that I haven't written one of the 'traditional' sort routines since leaving University. It's nice to know the theory behind it, but to apply them to real-world situations that can't be done by other means doesn't happen very often (at least from my experience...).

blocks|key|3203832|text|仅限雇主面试/测试=)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3203833|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

only on employer's interview/test =)

blocks|key|3204246|text|我写了一个合并排序时，我必须排序几十亿字节的文件与自定义的键比较。我喜欢合并排序--它易于理解、稳定，并且在最坏情况下的性能为O(n+log+n)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3204247|我也一直在找借口试用radix+sort。它不像大多数排序算法那样通用，所以不会有任何库提供它，但在合适的环境下，它应该是一个很好的加速。|offset|length|3204248|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Radix_sort^0|0|A|A|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

I wrote a merge sort when I had to sort multi-gigabyte files with a custom key comparison. I love merge sort - it's easy to comprehend, stable, and has a worst-case O(n log n) performance.

I've been looking for an excuse to try <a href="http://en.wikipedia.org/wiki/Radix_sort" rel="nofollow noreferrer">radix sort</a> too. It's not as general purpose as most sorting algorithms, so there aren't going to be any libraries that provide it, but under the right circumstances it should be a good speedup.

blocks|key|888040|text|就我个人而言，我已经有一段时间不需要编写自己的排序代码了。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|888041|至于面试问题，它将淘汰那些在计算机科学课上不专心的人。|888042|您可以通过询问如何构建可比较的(大写C)对象或类似的东西来测试API知识。|888043|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|I|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|J|8|@]|9|@]|A|$]]|$1|F|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|G|$]]

Personally, I've not had a need to write my own sorting code for a while.

As far as interview questions go, it would weed out those who didn't pay attention during CS classes.

You could test API knowledge by asking how would you build Comparable (Capital C) objects, or something along those lines.

blocks|key|3204126|text|在我看来，就像其他许多知识领域一样，编程也有理论和实践的方法。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3204127|“理论编程”这个领域给了我们快速排序，基数排序，贾克斯特拉算法和许多其他对计算的发展绝对必要的东西。|3204128|“实践编程”领域涉及的事实是，在“理论编程”中创建的解决方案应该以一种更容易的方式容易地为所有人所使用，以便理论思想能够获得许多、许多创造性的用途。这给了我们像Python这样的高级语言，并允许几乎任何语言实现最基本的操作的打包方法，如排序或搜索，具有足够好的性能，几乎适合所有人。|3204129|一个离不开另一个..。我们中的大多数人不需要硬编码排序算法并不意味着没有人需要这样做。|3204130|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|K|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|L|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|M|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|I|$]]

The way I see it, just like many others fields of knowledge, programming also has a theoretical and a practical approach to it.

The field of "theoretical programming" is the one that gave us quicksort, Radix Sort, Djikstra's Algorithm and many other things absolutely necessary to the advance of computing.

The field of "practical programming" deals with the fact that the solutions created in "theoretical programming" should be easily accessible to all in a much easier way, so that the theoretical ideas can get many, many creative uses. This gave us high-level languages like Python and allowed pretty much any language to implement packed methods for the most basics operations like sorting or searching with a good enough performance to be fit for almost everyone.

One can't live without the other...
most of us not needing to hard code a sorting algorithm doesn't mean no one should.

blocks|key|1045935|text|我不得不写出一种类似的东西。我有一个文本列表..最常见的十个必须根据它们被选中的频率显示出来。所有其他条目都必须按照alpha排序显示。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1045936|这并不是很难做到，但我确实需要编写一种排序来支持它。|1045937|我还必须对元素不容易用开箱即用代码排序的对象进行排序。|1045938|搜索也是如此..我不得不遍历一个文件并搜索静态大小的记录..当我发现一条记录时，我不得不向后移动一条记录，因为我是在它之前插入的。在大多数情况下，它非常简单，我只是粘贴了一个二进制搜索。需要做一些更改来支持访问方法，因为我使用的不是真正在内存中的数组。啊，c&@p..我本可以把它当成一条小溪..现在我想回去看看..|1045939|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|K|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|L|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|M|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|I|$]]

I've reciently had to write a sort, of sorts. 
I had a list of text.. the ten most common had to show up according to the frequency at which they were selected. All other entries had to show up according to alpha sort. 

It wasn't crazy hard to do but I did have to write a sort to support it. 

I've also had to sort objects whose elements aren't easily sorted with an out of the box code. 

Same goes for searching.. I had to walk a file and search staticly sized records.. When I found a record I had to move one record back, because I was inserting before it. 
For the most part it was very simple and I mearly pasted in a binary search. Some changes needed to be done to support the method of access, because I wasn't using an array that was acutally in memory.. Ah c&amp;@p.. I could have treated it like a stream.. See now I want to go back and take a look..

blocks|key|3203865|text|伙计，如果有人在面试中问我最好的排序算法是什么，当我说“timsort”时，我不能立即理解，我会认真地重新考虑我是否想在那里工作。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3203866|时间排序|3203867|3203868|这描述了一个自适应的，稳定的，自然的合并排序，谦虚地称为timsort+(嘿，我赢得了它)。它在许多类型的偏序阵列上具有超自然的性能(小于lg(N!)需要进行比较，并且只需N-1)，但速度与Python之前在随机数组上的高度调优的样本排序混合一样快。|blockquote|3203869|3203870|简而言之，main例程从左到右遍历数组一次，交替地识别下一次运行，然后“智能地”将其合并到前几次运行中。其他一切都是速度的复杂性，以及一些来之不易的内存效率衡量标准。|3203871|3203872|http://svn.python.org/projects/python/trunk/Objects/listsort.txt+Is+timsort+general-purpose+or+Python-specific?|offset|length|3203873|entityMap|0|LINK|mutability|MUTABLE|url|http://svn.python.org/projects/python/trunk/Objects/listsort.txt|1|https://stackoverflow.com/questions/154504/is-timsort-general-purpose-or-python-specific^0|0|0|0|0|0|0|0|0|1S|0|1T|1A|1|0^^$0|@$1|2|3|4|5|6|7|Z|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|10|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|11|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|12|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|13|8|@]|9|@]|A|$]]|$1|I|3|J|5|6|7|14|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|15|8|@]|9|@]|A|$]]|$1|L|3|M|5|6|7|16|8|@]|9|@$N|17|O|18|1|19]|$N|1A|O|1B|1|1C]]|A|$]]|$1|P|3|-4|5|6|7|1D|8|@]|9|@]|A|$]]]|Q|$R|$5|S|T|U|A|$V|W]]|X|$5|S|T|U|A|$V|Y]]]]

Man, if someone asked me in an interview what the best sort algorithm was, and didn't understand immediately when I said 'timsort', I'd seriously reconsider if I wanted to work there.

Timsort

<blockquote>
 This describes an adaptive, stable,
 natural mergesort, modestly called
 timsort (hey, I earned it ). It
 has supernatural performance on many
 kinds of partially ordered arrays
 (less than lg(N!) comparisons needed,
 and as few as N-1), yet as fast as
 Python's previous highly tuned
 samplesort hybrid on random arrays.
 
 In a nutshell, the main routine
 marches over the array once, left to
 right, alternately identifying the
 next run, then merging it into the
 previous runs "intelligently". 
 Everything else is complication for
 speed, and some hard-won measure of
 memory efficiency.
</blockquote>

<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt" rel="nofollow noreferrer">http://svn.python.org/projects/python/trunk/Objects/listsort.txt</a>
<a href="https://stackoverflow.com/questions/154504/is-timsort-general-purpose-or-python-specific">Is timsort general-purpose or Python-specific?</a>

blocks|key|4671507|text|我还没有真正实现排序，只是作为编码练习和观察一种语言的有趣特性(比如如何在Python中的一行上进行快速排序)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4671508|我认为这是一个在面试中提出的合理问题，因为它反映了开发人员是否考虑过这些事情……我觉得当你调用list.sort()时，知道它在做什么是很重要的。作为一个程序员，你应该知道所有事情背后的基本原理，这只是我的理论的一部分。|4671509|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

I haven't really implemented a sort, except as coding exercise and to observe interesting features of a language (like how you can do quicksort on one line in Python).

I think it's a valid question to ask in an interview because it reflects whether the developer thinks about these kind of things... I feel it's important to know what that list.sort() is doing when you call it. It's just part of my theory that you should know the fundamentals behind everything as a programmer.

blocks|key|4671575|text|我从来没有写过任何有库例程的东西。我已经几十年没有写过排序了。我也永远不会。由于可以直接使用快速排序和时间排序，因此没有理由编写排序。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4671576|我注意到SQL为我做排序。|4671577|有很多我没有写的东西，排序只是其中之一。|4671578|我从不编写自己的I/O驱动程序。(尽管我过去有过。)|4671579|我从来没有写过自己的图形库。(是的，我也做过一次，那是在80年代)|4671580|我从来没有写过自己的文件系统。(避免了这种情况。)|4671581|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|P|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|Q|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|R|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|S|8|@]|9|@]|A|$]]|$1|L|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|M|$]]

I never write anything for which there's a library routine. I haven't coded a sort in decades. Nor would I ever. With quicksort and timsort directly available, there's no reason to write a sort.

I note that SQL does sorting for me. 

There are lots of things I don't write, sorts being just one of them.

I never write my own I/O drivers. (Although I have in the past.)

I never write my own graphics libraries. (Yes, I did this once, too, in the '80s)

I never write my own file system. (Avoided this.)

blocks|key|3204068|text|现在绝对没有理由再编写代码了。我认为重要的是要了解你正在使用的数据的效率，这样你就可以为你正在排序的数据选择最好的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3204069|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

There is definitely no reason to code one anymore. I think it is important though to understand the efficiency of what you are using so that you can pick the best one for the data you are sorting.

blocks|key|4671693|text|是。当您的列表最多只有几十条记录时，挖掘出Shell排序有时会胜过内置排序例程。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4671694|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Yes. Sometimes digging out Shell sort beats the builtin sort routine when your list is only expected to be at most a few tens of records.

People in java/.net world has framework which provides methods for sorting a list.

In CS, we all might have gone through Bubble/Insertion/Merge/Shell sorting algorithms.
Do you write any of it these days?

With frameworks in place, do you write code for sorting? 

Do you think it makes sense to ask people to write code to sort in an interview? (other than for intern/junior developer requirement)

Do you write code to sort a list these days?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

java/.net世界中的人们有一个框架，它提供了对列表进行排序的方法。在CS中，我们可能都经历过Bubble/Insertion/Merge/Shell排序算法。这些天你有写过这些吗？有了适当的框架，你会编写排序代码吗？你认为让人们写代码在面试中排序是有意义的吗？(实习生/初级开发人员要求除外)

问最近你会写代码来排序列表吗？
EN

回答 14

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问最近你会写代码来排序列表吗？EN

回答 14

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问最近你会写代码来排序列表吗？
EN