### TimSort for .NET

•        0

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 algorithms mergesort quicksort sorting timsort Implementation CSharp License Apache Platform Windows

## sorting-optimal - QuickSort e MergeSort

QuickSort e MergeSort

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

BubbleSort, InsertionSort, MergeSort and QuickSort in Ruby

## algorithms - algorithms playground for common questions

- [Dijkstra's shortest path between two nodes](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)- [Find the square root of a number](https://en.wikipedia.org/wiki/Newton%27s_method)- [Binary search](https://en.wikipedia.org/wiki/Binary_search_algorithm)- [Longest increasing subsequence](http://en.wikipedia.org/wiki/Longest_increasing_subsequence) - [Find all permutations of array](https://en.wikipedia.org/wiki/Permutation)- [Finding all combinations of well-formed brackets](http://stackover

## 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 - Collection of sorting Algorithms

Collection of sorting Algorithms

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

## Sorting-algorithms-demo - Animated demo of sorting algorithms in Java

Animated demo of sorting algorithms in Java

We have large collection of open source products. Follow the tags from Tag Cloud >>