CODEWITHSUNDEEP
c#.netarrays
Sammy
Sammy

Reputation: 31

Custom array sort

Each item/string in my array starts with two letters followed by two or three numbers and then sometimes followed by another letter.

Examples, RS01 RS10 RS32A RS102 RS80 RS05A RS105A RS105B

I tried to sort this using the default Array.Sort but it came back with this...

RS01
RS05A
RS10
RS102
RS105A
RS105B
RS32A
RS80

But I need it like this..

RS01
RS05A
RS10
RS32A
RS80
RS102
RS105A
RS105B

Any Ideas?

Upvotes: 3

Views: 243

Answers (3)

Tim Schmelter
Tim Schmelter

Reputation: 460058

You can use this linq query:

var strings = new[] { 
    "RS01","RS05A","RS10","RS102","RS105A","RS105B","RS32A","RS80"
};
strings = strings.Select(str => new
{
    str,
    num = int.Parse(String.Concat(str.Skip(2).TakeWhile(Char.IsDigit))),
    version = String.Concat(str.Skip(2).SkipWhile(Char.IsDigit))
})
.OrderBy(x => x.num).ThenBy(x => x.version)
.Select(x => x.str)
.ToArray();

DEMO

Result:

RS01
RS05A
RS10
RS32A
RS80
RS102
RS105A
RS105B

Upvotes: 2

Sergey Berezovskiy
Sergey Berezovskiy

Reputation: 236208

Here is sorting with custom comparison delegate and regular expressions:

string[] array = { "RS01", "RS10", "RS32A", "RS102", 
                   "RS80", "RS05A", "RS105A", "RS105B" };

Array.Sort(array, (s1, s2) =>
    {
        Regex regex = new Regex(@"([a-zA-Z]+)(\d+)([a-zA-Z]*)");
        var match1 = regex.Match(s1);                                        
        var match2 = regex.Match(s2);

        // prefix
        int result = match1.Groups[1].Value.CompareTo(match2.Groups[1].Value);
        if (result != 0)
            return result;

        // number 
        result = Int32.Parse(match1.Groups[2].Value)
                        .CompareTo(Int32.Parse(match2.Groups[2].Value));

        if (result != 0)
            return result;

        // suffix
        return match1.Groups[3].Value.CompareTo(match2.Groups[3].Value);
    });

UPDATE (little refactoring, and moving all stuff to separate comparer class). Usage:

Array.Sort(array, new RSComparer());

Comparer itself:

public class RSComparer : IComparer<string>
{
    private Dictionary<string, RS> entries = new Dictionary<string, RS>();

    public int Compare(string x, string y)
    {
        if (!entries.ContainsKey(x))
            entries.Add(x, new RS(x));

        if (!entries.ContainsKey(y))
            entries.Add(y, new RS(y));

        return entries[x].CompareTo(entries[y]);
    }

    private class RS : IComparable
    {
        public RS(string value)
        {
            Regex regex = new Regex(@"([A-Z]+)(\d+)([A-Z]*)");
            var match = regex.Match(value);
            Prefix = match.Groups[1].Value;
            Number = Int32.Parse(match.Groups[2].Value);
            Suffix = match.Groups[3].Value;
        }

        public string Prefix { get; private set; }
        public int Number { get; private set; }
        public string Suffix { get; private set; }

        public int CompareTo(object obj)
        {
            RS rs = (RS)obj;
            int result = Prefix.CompareTo(rs.Prefix);
            if (result != 0)
                return result;

            result = Number.CompareTo(rs.Number);
            if (result != null)
                return result;

            return Suffix.CompareTo(rs.Suffix);
        }
    }
}

Upvotes: 5

Ben
Ben

Reputation: 6059

You'll want to write a custom comparer class implementing IComparer<string>; it's pretty straightforward to break your strings into components. When you call Array.Sort, give it an instance of your comparer and you'll get the results you want.

Upvotes: 0

Related Questions