Simple Merge Sort

  •        47

This is a simple implementation of Merge-Sort, using to sort an Array of Integers.

http://simplemergesort.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

go-algorithms - Algorithms and data structures for golang


* bubble sort * selection sort * merge sort * cocktail sort * gnome sort * quick sort * comb sort * odd/even sort * heap sort * Shell sort * counting sort

Sorting Algorithm Visualization


Sorting Algorithm Visualization Displays Bead Sort, Binary Tree Sort, Bubble Sort, Bucket Sort, Cocktail Sort, Counting Sort, Gnome Sort, In Place Merge Sort, Insertion Sort, Merge Sort and more...

sort - sort algorithms(quick sort, heap sort, merge sort) c implementation


sort algorithms(quick sort, heap sort, merge sort) c implementation

perl-File-Sort - File::Sort - sort a file or merge sort multiple files


File::Sort - sort a file or merge sort multiple files

SortingAlgorithm - sorting with heap sort, merge sort and selection sort


sorting with heap sort, merge sort and selection sort



dictionary_order_sort - Sort an array of strings with the same logic as `sort --dictionary-sort`


Sort an array of strings with the same logic as `sort --dictionary-sort`

SimpleSorting - Bubble Sort, Selection Sort, Insertion Sort


Bubble Sort, Selection Sort, Insertion Sort

unix-sort - Sort large streams of JSON objects using the unix sort command.


Sort large streams of JSON objects using the unix sort command.

wong-sort - WONG-sort: A play on WIND-sort


WONG-sort: A play on WIND-sort

sort-items - jqueryui sort items and custom jquery sort


jqueryui sort items and custom jquery sort

perl-Sort-Key - Sort::Key - interface to sort arrays by one or manipulate calculated keys


Sort::Key - interface to sort arrays by one or manipulate calculated keys

Acme-Sort-Bozo - Perl module: "Another stupid sort": Sort in O(n!) time.


Perl module: "Another stupid sort": Sort in O(n!) time.

Acme-Sort-Bogosort - Perl module: "Stupid sort": Sort in O(n!) time.


Perl module: "Stupid sort": Sort in O(n!) time.

go-sort - sort utils: sort map by value, etc.


sort utils: sort map by value, etc.

sort-naturally - (perl) sort lexically, but sort numeral parts numerically


(perl) sort lexically, but sort numeral parts numerically

Sort-XS - Sort::XS - a ( very ) fast XS sort alternative for one dimension list


Sort::XS - a ( very ) fast XS sort alternative for one dimension list

externalsortinginjava - External-Memory Sorting in Java


Sometimes, you want to sort large file without first loading them into memory. The solution is to use External Sorting. You divide the files into small blocks, sort each block in RAM, and then merge the result. Many database engines and the Unix sort command support external sorting. But what if you want to avoid a database? Or what if you want to sort in a non-lexicographic order? Or maybe you just want a simple external sorting example? When we could not find such a simple program, we wrote one.

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.

sortSpeed - speed of quicksort, merge sort, in-place merge sort, and heapsort


speed of quicksort, merge sort, in-place merge sort, and heapsort