TimSort for .NET

  •        122

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 ...

http://timsort4net.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

rust-sorts - Implementations of common sorting algorithms in Rust with comprehensive tests and benchmarks


A comparison of different sort algorithms in Rust. This includes mergesort, quicksort, heapsort, insertion sort, selection sort, bubble sort and even bogo sort. The library comes with benchmarks for vectors of different sizes and for vectors that are already sorted or vectors where all elements are equivalent. This library also comes with QuickCheck tests that check whether the result of a sorting algorithm is sorted. Each algorithm is also checked that it is stable/unstable depending on the algorithm used.Many of the implementations were done with inspiration from the relevant Wikipedia articles.

Sorting-Homework - BubbleSort, InsertionSort, MergeSort and QuickSort in Ruby


BubbleSort, InsertionSort, MergeSort and QuickSort in Ruby

radix - A fast string sorting algorithm


This is an optimized sorting algorithm equivalent to sort.Strings in the Go standard library. For string sorting, a carefully implemented radix sort can be considerably faster than Quicksort, sometimes more than twice as fast.A discussion of MSD radix sort, its implementation and a comparison with other well-known sorting algorithms can be found in Implementing radixsort.

JRollSortComparison - Comparison of various sorts such as QuickSort, MergeSort, etc


Comparison of various sorts such as QuickSort, MergeSort, etc



calgorithms - QuickSort, MergeSort, Karger's alg and other


QuickSort, MergeSort, Karger's alg and other

BasicSortingAlgorithm


Sorting algorithm implementation in C# includes veriation of variations of quicksort, mergesort, and more

haskell-timsort - An adaptive, stable, natural mergesort implemented on mutable vectors.


An adaptive, stable, natural mergesort implemented on mutable vectors.

rust-quicksort - A Rust quicksort implementation for in-place sorting.


A Rust quicksort implementation for in-place sorting.

quicksort - Quicksort algorithms


Quicksort algorithms

MergeSort-and-CountInversions


A short bit of Python code implementing the algorithms for MergeSort and array Inversion counting. Based on Coursera Algorithms Design first programming project

sorting-generic - quicksort java with generic type


quicksort java with generic type

QuickSort


This is a basic example of a quickSort algorithm, quick sort is the quickest sorting algorithm wit a time complexity of nlogn

sorting-algorithms-tests - Small sorting algorithms project with efficiency tests.


Small sorting algorithms project with efficiency tests.

sorting-algorithms-js - Collection of sorting algorithms written in javascript.


Collection of sorting algorithms written in javascript.

Sorting-Algorithms - A collection of a few sorting algorithms


A collection of a few sorting algorithms

Sorting-Algorithms - Implementation of basic sorting algorithms. (DSA Coursework 2)


Implementation of basic sorting algorithms. (DSA Coursework 2)

sorting-algorithms - A collection of sorting algorithms implemented in Java.


A collection of sorting algorithms implemented in Java.

Sorting-Algorithms - Contains code for performing various kinds of sorting algorithms.


Contains code for performing various kinds of sorting algorithms.