notes examplesort { using quicksort swap pivot value pivot value swap and swap and swap and stop partition run quick sort recursively sorted noticethat we show here only the first recursion stepin order not to make example too long butin fact{ and { are sorted then recursively why does it workon the partition step algorithm divides the array into two parts and every element from the left part is less or equal than every element from the right part also and satisfy <pivot < inequality after completion of the recursion calls both of the parts become sorted andtaking into account arguments stated abovethe whole array is sorted exampleconsider the following list to be sorted in ascending order 'add your man(ignore blanksn [ quicksort ( > 'nl - 'yvthere forel [ 'avthere forer lovely professional university