有时候需要将文件名按照数字大小排序，而不是按照字母顺序排序，例如：

1000X Radonius Maximus10X Radonius200X Radonius20X Radonius20X Radonius Prime30X Radonius40X RadoniusAllegia 50 ClasteronAllegia 500 ClasteronAllegia 50B ClasteronAllegia 51 ClasteronAllegia 6R ClasteronAlpha 100Alpha 2Alpha 200Alpha 2AAlpha 2A-8000Alpha 2A-900Callisto MorphamaxCallisto Morphamax 500Callisto Morphamax 5000Callisto Morphamax 600Callisto Morphamax 6000 SECallisto Morphamax 6000 SE2Callisto Morphamax 700Callisto Morphamax 7000Xiph Xlater 10000Xiph Xlater 2000Xiph Xlater 300Xiph Xlater 40Xiph Xlater 5Xiph Xlater 50Xiph Xlater 500Xiph Xlater 5000Xiph Xlater 58

10X Radonius20X Radonius20X Radonius Prime30X Radonius40X Radonius200X Radonius1000X Radonius MaximusAllegia 6R ClasteronAllegia 50 ClasteronAllegia 50B ClasteronAllegia 51 ClasteronAllegia 500 ClasteronAlpha 2Alpha 2AAlpha 2A-900Alpha 2A-8000Alpha 100Alpha 200Callisto MorphamaxCallisto Morphamax 500Callisto Morphamax 600Callisto Morphamax 700Callisto Morphamax 5000Callisto Morphamax 6000 SECallisto Morphamax 6000 SE2Callisto Morphamax 7000Xiph Xlater 5Xiph Xlater 40Xiph Xlater 50Xiph Xlater 58Xiph Xlater 300Xiph Xlater 500Xiph Xlater 2000Xiph Xlater 5000Xiph Xlater 10000

   在Windows XP及以后的系统中，通过修改注册表，或者使用组策略（实质上还是修改注册表），可以控制使用哪种排序方式，进行文件名排序。在

HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Policies\Explorer下面创建

DWORD键：NoStrCmpLogical，然后设置值为1，禁止使用智能排序；设置为0，启用智能排序。

程序实现智能排序，有人已经写了，在这转一下C#实现。最后的参考列表中的网址上，有各种语言的实现方法。

/* * The Alphanum Algorithm is an improved sorting algorithm for strings * containing numbers.  Instead of sorting numbers in ASCII order like * a standard sort, this algorithm sorts numbers in numeric order. * * The Alphanum Algorithm is discussed at http://www.DaveKoelle.com * * Based on the Java implementation of Dave Koelle's Alphanum algorithm. * Contributed by Jonathan Ruckwood 
     
       * * Adapted by Dominik Hurnaus 
      
        to *   - correctly sort words where one word starts with another word *   - have slightly better performance * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA * */using System;using System.Collections;using System.Text;/* * Please compare against the latest Java version at http://www.DaveKoelle.com * to see the most recent modifications */namespace AlphanumComparator{    public class AlphanumComparator : IComparer    {        private enum ChunkType {Alphanumeric, Numeric};        private bool InChunk(char ch, char otherCh)        {            ChunkType type = ChunkType.Alphanumeric;            if (char.IsDigit(otherCh))            {                type = ChunkType.Numeric;            }            if ((type == ChunkType.Alphanumeric && char.IsDigit(ch))                || (type == ChunkType.Numeric && !char.IsDigit(ch)))            {                return false;            }            return true;        }        public int Compare(object x, object y)        {            String s1 = x as string;            String s2 = y as string;            if (s1 == null || s2 == null)            {                return 0;            }            int thisMarker = 0, thisNumericChunk = 0;            int thatMarker = 0, thatNumericChunk = 0;            while ((thisMarker < s1.Length) || (thatMarker < s2.Length))            {                if (thisMarker >= s1.Length)                {                    return -1;                }                else if (thatMarker >= s2.Length)                {                    return 1;                }                char thisCh = s1[thisMarker];                char thatCh = s2[thatMarker];                StringBuilder thisChunk = new StringBuilder();                StringBuilder thatChunk = new StringBuilder();                while ((thisMarker < s1.Length) && (thisChunk.Length==0 ||InChunk(thisCh, thisChunk[0])))                {                    thisChunk.Append(thisCh);                    thisMarker++;                    if (thisMarker < s1.Length)                    {                        thisCh = s1[thisMarker];                    }                }                while ((thatMarker < s2.Length) && (thatChunk.Length==0 ||InChunk(thatCh, thatChunk[0])))                {                    thatChunk.Append(thatCh);                    thatMarker++;                    if (thatMarker < s2.Length)                    {                        thatCh = s2[thatMarker];                    }                }                int result = 0;                // If both chunks contain numeric characters, sort them numerically                if (char.IsDigit(thisChunk[0]) && char.IsDigit(thatChunk[0]))                {                    thisNumericChunk = Convert.ToInt32(thisChunk.ToString());                    thatNumericChunk = Convert.ToInt32(thatChunk.ToString());                    if (thisNumericChunk < thatNumericChunk)                    {                        result = -1;                    }                    if (thisNumericChunk > thatNumericChunk)                    {                        result = 1;                    }                }                else                {                    result = thisChunk.ToString().CompareTo(thatChunk.ToString());                }                if (result != 0)                {                    return result;                }            }            return 0;        }    }}
      
     

参考：