# def quicksort1(array): # doquicksort1(array, 0, len(array)-1) # # # def doquicksort1(array, low, height): # if low < height: # mid = (low + height) // 2 # partition1(mid, array) # doquicksort1(array, low, mid - 1) # doquicksort1(array, mid + 1, height) # # # def partition1(mid, array): # # # def quicksort2(array): # print(array) # # # quicksort1([1, 5, 7, 8, 2, 34, 6, 0, 3]) # quicksort2([1, 5, 7, 8, 2, 34, 6, 0, 3])
