blocks|key|1436555|text|这就是所谓的“自然排序”。杰夫不久前在它上面有一个pretty+extensive+blog+entry，它描述了您可能忽略的困难，并有到几个实现的链接。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1436556|entityMap|0|LINK|mutability|MUTABLE|url|http://blog.codinghorror.com/sorting-for-humans-natural-sort-order/^0|P|R|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

It's called "natural sort order". Jeff had a <a href="http://blog.codinghorror.com/sorting-for-humans-natural-sort-order/" rel="noreferrer">pretty extensive blog entry</a> on it a while ago, which describes the difficulties you might overlook and has links to several implementations.

blocks|key|1651130|text|据我所知，Windows资源管理器是按照你的第二个例子进行排序的--排序结果是1、10、2，这让我非常恼火。这就是为什么大多数写很多文件的应用程序(比如批处理应用程序)总是使用固定长度的文件名，以0开头。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1651131|您的解决方案应该是有效的，但是您需要注意数字在文件名中的位置，并且可能只在它们位于最后时才使用您的方法。|1651132|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|$]]

The way I understood it, Windows Explorer sorts as per your second example - it's always irritated me hugely that the ordering comes out 1, 10, 2. That's why most apps which write lots of files (like batch apps) always use fixed length filenames with leading 0's or whatever.

Your solution should work, but you'd need to be careful where the numbers were in the filename, and probably only use your approach if they were at the very end.

blocks|key|1651175|text|看一看|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1651176|http://www.interact-sw.co.uk/iangblog/2007/12/13/natural-sorting|offset|length|1651177|获取一些源代码。|1651178|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|1S|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|P|8|@]|9|@$D|Q|E|R|1|S]]|A|$]]|$1|F|3|G|5|6|7|T|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|U|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|C]]]]

Have a look at

<a href="http://www.interact-sw.co.uk/iangblog/2007/12/13/natural-sorting" rel="nofollow noreferrer">http://www.interact-sw.co.uk/iangblog/2007/12/13/natural-sorting</a>

for some source code.

blocks|key|1651210|text|Explorer使用natural+sort+order接口。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1651211|您不需要编写自己的比较函数，只需使用已存在的函数即可。|1651212|一个很好的解释可以在here找到。|1651213|entityMap|0|LINK|mutability|MUTABLE|url|http://msdn.microsoft.com/en-us/library/bb759947(VS.85%2529.aspx)()%2520for%2520this%2520kind%2520of%2520sorting%2520(called|1|http://www.siao2.com/2005/01/05/346933.aspx^0|A|I|0|0|0|A|4|1|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@$A|S|B|T|1|U]]|C|$]]|$1|D|3|E|5|6|7|V|8|@]|9|@]|C|$]]|$1|F|3|G|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|H|3|-4|5|6|7|10|8|@]|9|@]|C|$]]]|I|$J|$5|K|L|M|C|$N|O]]|P|$5|K|L|M|C|$N|Q]]]]

Explorer uses the API <a href="http://msdn.microsoft.com/en-us/library/bb759947(VS.85).aspx" rel="nofollow noreferrer">StrCmpLogicalW</a>() for this kind of sorting (called 'natural sort order').

You don't need to write your own comparison function, just use the one that already exists.

A good explanation can be found <a href="http://www.siao2.com/2005/01/05/346933.aspx" rel="nofollow noreferrer">here</a>.

blocks|key|1436740|text|有StrCmpLogicalW，但它只从Windows+XP开始可用，并且只以Unicode的形式实现。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1436741|一些背景信息：http://www.siao2.com/2006/10/01/778990.aspx|1436742|entityMap|0|LINK|mutability|MUTABLE|url|http://msdn.microsoft.com/en-us/library/bb759947.aspx|1|http://www.siao2.com/2006/10/01/778990.aspx^0|1|E|0|0|7|17|1|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]]|C|$]]|$1|D|3|E|5|6|7|T|8|@]|9|@$A|U|B|V|1|W]]|C|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]|N|$5|I|J|K|C|$L|O]]]]

There is <a href="http://msdn.microsoft.com/en-us/library/bb759947.aspx" rel="nofollow noreferrer">StrCmpLogicalW</a>, but it's only available starting with Windows XP and only implemented as Unicode.

Some background information:
<a href="http://www.siao2.com/2006/10/01/778990.aspx" rel="nofollow noreferrer">http://www.siao2.com/2006/10/01/778990.aspx</a>

blocks|key|1651295|text|我还发布了一个相关的问题，并提供了额外的提示和陷阱：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1651296|Sorting+strings+is+much+harder+than+you+thought|offset|length|1651297|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/127913/sorting-strings-is-much-harder-than-you-thought^0|0|0|1B|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 also posted a related question with additional hints and pitfalls: 

<a href="https://stackoverflow.com/questions/127913/sorting-strings-is-much-harder-than-you-thought">Sorting strings is much harder than you thought</a>

blocks|key|1651310|text|我在这里发布了代码(C#)和算法描述：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1651311|Natural+Sort+Order+in+C#|offset|length|1651312|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/248603/natural-sort-order-in-c/7048016#7048016^0|0|0|O|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 posted code (C#) and a description of the algorithm here:

<a href="https://stackoverflow.com/questions/248603/natural-sort-order-in-c/7048016#7048016">Natural Sort Order in C#</a>

blocks|key|1436847|text|这是在Java中实现它的一次尝试：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1436848|Java+-+Sort+Strings+like+Windows+Explorer|offset|length|1436849|简而言之，它将两个字符串拆分成字母数字部分进行比较，并以一种特定的方式比较这些部分，从而实现这种排序。|1436850|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/23205020/java-sort-strings-like-windows-explorer/23249000#23249000^0|0|0|15|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@$D|R|E|S|1|T]]|A|$]]|$1|F|3|G|5|6|7|U|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|V|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|O]]]]

This is a try to implement it in Java:

<a href="https://stackoverflow.com/questions/23205020/java-sort-strings-like-windows-explorer/23249000#23249000">Java - Sort Strings like Windows Explorer</a>

In short it splits the two Strings to compare in Letter - Digit Parts and compares this parts in a specific way to achieve this kind of sorting.

I'm looking for an algorithm that sorts strings similar to the way files (and folders) are sorted in Windows Explorer. It seems that numeric values in strings are taken into account when sorted which results in something like

<pre><code>name 1, name 2, name 10
</code></pre>

instead of

<pre><code>name 1, name 10, name 2
</code></pre>

which you get with a regular string comparison.

I was about to start writing this myself but wanted to check if anyone had done this before and was willing to share some code or insights. The way I would approach this would be to add leading zeros to the numeric values in the name before comparing them. This would result in something like

<pre><code>name 00001, name 00010, name 00002
</code></pre>

which when sorted with a regular string sort would give me the correct result.

Any ideas?

Windows Explorer sort method

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

我正在寻找一种算法，它可以对字符串进行排序，类似于Windows资源管理器中文件(和文件夹)的排序方式。似乎对字符串中的数值进行排序时会将其考虑在内，结果如下所示name 1, name 2, name 10而不是name 1, name 10, name 2这是通过常规的字符串比较得到的。我正要开始自己写这篇文章，但...

问Windows资源管理器排序方法
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Windows资源管理器排序方法EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Windows资源管理器排序方法
EN