Alghorithm : Quick sort .
idea : devide and conqure .
steps : 1- find the pivot point from array like first element . 2- partiotioning the array so that elements are smaller than pivot point are in the left side and ones are bigger in the right side . 3- sorting both sub arrays (recursion)
Question : i know all of the steps but i don't know how to sorting sub arrays in step 3 . i can't find any example that explains this ending part .
if you look at this you see that both sub arrays are unsorted and we should complete steps with recursion method to solve this and this is my question .
but can you explian this for me ?