Displaying 1 to 7 from 7 results

TimSort for .NET

  •    CSharp

TimSort is relatively new sorting algorithm invented by Tim Peters in 2002, which is a hybrid of adaptive MergeSort and InsertionSort. It is not worse than QuickSort which modified version is used as default sorting algorithm in .NET. TimSort's average case performance is O(n ...

ndarray-sort - Sorts ndarrays in place

  •    Javascript

Sorts ndarrays in place using a dual pivot quick sort.Sorts the given array along the first axis in lexicographic order. The sorting is done in place.