Computer Science · Algorithms

For the quicksort partition code on arr = [4, 2, 5, 1, 3] with pivot as the last element (arr[4] = 3), what is the returned pivot index after partition? def partition(arr, low, high): pivot = arr[high] i = low - 1 for j in range(low, high): if arr[j] <= pivot: i += 1 arr[i], arr[j] = arr[j], arr[i] arr[i+1], arr[high] = arr[high], arr[i+1] return i + 1 print(partition(arr, 0, 4))