Implementing quicksort algorithm

Question

I found quicksort algorithm from this book

This is the algorithm

QUICKSORT (A, p, r)
i         


        

Answer 1

This is the shortest implementation of Quick Sort algorithm (Without StackOverflowException)

IEnumerable<T> QuickSort<T>(IEnumerable<T> i) where T :IComparable
{
    if (!i.Any()) return i;
    var p = i.ElementAt(new Random().Next(0, i.Count() - 1));
    return QuickSort(i.Where(x => x.CompareTo(p) < 0)).Concat(i.Where(x => x.CompareTo(p) == 0)).Concat(QuickSort(i.Where(x => x.CompareTo(p) > 0)));
}