Effective JavaScript Merge sort algorithm
Posted on September 27th, 2018 in JavaScript by George
Merge sort it is very effective sorting algorithm with an Worst Time complexity of O(n log(n)) being more effective in comparison with Quick sort O(n^2) and insertion sort O(n^2) for a hypothetical large data set.