MergeSort algorithm

Added By: poxe

Rated:
(4 of 5) by 1.
Rate Snippet:
Description:  The MergeSort algorithm is one of the quicker sort algorithms known. It has a "complexity" of n*log(n), which means that if you need to order some elements, it will take a time defined by n*log(n) where n is the time needed to perform operations on a single element. In some cases it is quicker than the quicksort algorithm, which is known to be the quickest sort known algrithm. It is also about six time faster than the sort method in the Array object of Internet Explorer.
Language:  JavaScript

Save to web space
E-mail Link

Code Snippet: