If you wonder what's "Tree Fiddy";
It's a very old joke from one of the early seasons of South Park. Its now a popular circle-jerky response to most numerical questions.

I am the one who feel guilty with my solution.
Great solution.

It's not O(n^2) ya doofus. It's O(n * k), where n is number of splits, and k is the select (or vice versa). It's still very time complex, but it doesn't grow by the number of splits squared.

It's just named "sorted", not that it's sorted

The kata explicitely says the idea is not to sort it... Why is this considered best solution?

TimeSpan also has a FromHours function so you don't have to multiply the distance by 3600

This is the solution that StackOverflow recommends ;-)

good comment!

Does the use of a length 1 array in

text.Split(new[] {"\n"})

have any special benefit or purpose compared to

text.Split('\n')

?

Great solution! My brain feels better after reading this, since my solution was the opposite of elegant.

Brilliant solution!

Great kata idea tho...
snail for jagged arrays n * m
where n and me can be >=0.

Arrays are always n * n