The C standard library includes a quicksort function called qsort. It sorts homogeneous arrays of arbitrary type. The interface is exactly what you'd expect given the constraints of the language.
Quicksort algorithm is one of the most used sorting algorithm, especially to sort large list and most of the programming languages, library have implemented it in one or another way. In Java.
Today, I wanted to take a look at a pretty common sorting technique. Indeed anyone with a Bachelor in CS is expected to know how to implement QuickSort in java or another basic programming language.
Back to sorting! Today we moved on from our original selection sort into the world of merge sorting. Merge sort takes an array and splits it in half until there is only one value left. Then it proceeds to merge the array together in order.
