Please in detail explain what this code will do to the array 13, 42, 2, 16, 10, 3

1 2 3 4 5 6 arr = [29,99,27,41,66,28,44,78,87,19,31,76,58, 88, 83,97,12,21,44] n = len(arr) # partition Function handles sorting part of quick sort it moves the pivot element to its correct position # start and end points to first and last element of an array respectively def partition(array, start, end): pivot = array[start] low = start + 1 high = end 7 8 9 10 11 12 13 while True: # Decrement the high pointer till it finds an element less than pivot while low = pivot: | high = high - 1 # Increment the low pointer till it finds an element greater than pivot while low = end: return #p is partitioning index, means array[p] is at right place D = partition (array, start, end) 42 43 # Sort elements before partition # and after partition quick_sort(array, start, P-1) quick_sort(array, P+1, end) 44 45 46 47 48 49 50 51 52 53 # Code for testing arr = [29,99,27,41,66,28,44,78,87, 19,31,76,58,88,83,97,12,21,44] print(arr) n = len(arr) quick_sort(arr, , n-1) print(arr)