import numpy as np

arr = np.random.randint(0, 1001, 10)
print(arr)

def part(arr, low, high):
    pivot = arr[high]
    swap_number = low - 1

    for i in range(low, high):
        if arr[i] <= pivot:
            swap_number += 1 
            arr[swap_number],arr[i] = arr[i], arr[swap_number]

    arr[swap_number + 1],arr[high] = arr[high], arr[swap_number + 1]
    print(arr)
    
    return swap_number + 1

def quicksort(arr, low, high):
    if low < high:
        recursion = part(arr, low, high)
        quicksort(arr, low, recursion - 1)
        quicksort(arr, recursion + 1, high)
        
quicksort(arr, 0, len(arr) - 1)
print('Final Sort:')
print(arr)