/C#/Big sorting hackerrank solution in C#

Big sorting hackerrank solution in C#

int n = Convert.ToInt32(Console.ReadLine());
string[] a = new string[n];
for (int i = 0; i < n; i++) 
    a[i] = Console.ReadLine();

Array.Sort(a, (left, right) => {
    if (left.Length != right.Length)
        return left.Length - right.Length;
    else
        return string.CompareOrdinal(left, right); // left.CompareTo(right) is too slow
});
for (int i = 0; i < n; i++) 
    Console.WriteLine(a[i]);

Source: coding-gym.org

Similar codes

0 vote126 views1 answer
Nunit cleanup after all tests
C#
5 votes138 views4 answers
How to concatenate two arrays in c#
C#
1 vote133 views1 answer
Difference between executescalar and executenonquery and executereader
C#
11 votes121 views1 answer
Abril modal boostrap
C#
1 vote244 views1 answer
Unity inspector sliders
C#
1 vote127 views1 answer
Loop over enum values
C#
0 vote130 views1 answer
Static variable in c#
C#
0 vote128 views1 answer
Design pattern for so many conditions c#
C#
0 vote121 views1 answer
System.Drawing get from url
C#
3 votes134 views1 answer
C#image to bytes
C#