mergesort

Sorting algorithm

An efficient sorting algorithm with O(n log n) complexity.

O(n log n)

20 stars

3 watching

4 forks

Language: JavaScript

last commit: almost 6 years ago

Linked from 1 awesome list

Backlinks from these awesome lists:

lichunqiang/awesome-stars

Related projects:

Repository	Description	Stars
scandum/blitsort	An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management	703
0xdewy/quicksort-huff	An implementation of the Quicksort sorting algorithm using a custom data structure called Huff.	10
timsort/cpp-timsort	A C++ implementation of TimSort, an O(n log n) stable sorting algorithm.	303
scandum/quadsort	A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data	2,137
addyosmani/bubblesort	A bubble sort algorithm implementation with a comparison function for sorting arrays of elements in ascending or descending order	107
bonzaithepenguin/wikisort	An optimized sorting algorithm with O(1) memory usage.	1,273
mattreecebentley/plf_indiesort	A sorting algorithm that optimizes performance on non-random access containers and large data types	19
pi8027/stablesort	Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq.	22
skarupke/ska_sort	An implementation of the sorting algorithm known as Ska Sort in C++	235
swenson/sort	A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations	464
wildgums/orc.sort	Provides a collection of algorithms for sorting data in a programming language	17
simonwaldherr/golangsortingvisualization	Visualizes various sorting algorithms in Go with animations	125
marijnfs/zigtimsort	An implementation of a hybrid sorting algorithm with a focus on stability and adaptability	6
dcousens/is-sorted	A small utility module to check if an ordered list of values is in the correct sequence	23
yourbasic/radix	A fast string sorting algorithm implemented in Go.	192