The sorting-algorithms series is a collection of posts about reimplemented sorting algorithms in JavaScript. Sorting is one of the most common problems that programmers tackle when dealing with data processing. We’ll be going over some of the simple sorting algorithms that every programmer should have a grasp of - quicksort algorithm javascript.

All sorting algorithms have the same goal and they can all take the same input data. So, for every sorting algorithms of the series, we are going sort an array of 10 numbers from 1 to 10. Sorting algorithm are very sensitive to the input data so we will also try different input data to see how they affect the performances - javascript sort algorithm.

Sorting algorithms have been studied for decades, for example Bubble sort was analyzed as early and are still today. They also are a very good introduction to computer science because they allow to introduce severals algorithm concepts with a very simple goal. This is another reason why it is good to study them.

We can implement this algorithm using 2 functions. The first called mergeSort, which is the function we’ll call, and another one called _mergeArrays, which takes care of merging the arrays. For more information, please visit our site