The Quicksort algorithm in Java

Description: Qsort takes a list and chooses a value called (mval or pivot) near the middle. 1. Then it goes through the list putting all the numbers lower than the pivot to the left and all the values above to the right. 2. When it finishes, it merges both lists with pivot in the middle of the lists (left list + pivot + right list). It copies the list in a check list and it calls itself and does steps 1 and 2. 3. Then, it checks if the new list is the same as the check list, if it is not it calls itself and goes through step 1 and 2 and 3 until both lists are the same.