Day-15 by_Aaditya

#day15_challenge

n=int(input("enter size of array"))
array=[]
for i in range(0,n):
    x=int(input("enter element"))
    array.append(x)
print("Before sorting:",array)

def partition(start, end, array):

    pivot_index = start
    pivot = array[pivot_index]

    while start < end:
        while start < len(array) and array[start] <= pivot:
            start += 1

        while array[end] > pivot:
            end -= 1

        if (start < end):
            array[start], array[end] = array[end], array[start]
    array[end], array[pivot_index] = array[pivot_index], array[end]
    return end
def quick_sort(start, end, array):
    if (start < end):

        p = partition(start, end, array)
        quick_sort(start, p - 1, array)
        quick_sort(p + 1, end, array)

quick_sort(0, len(array) - 1, array)

print(f'Sorted array: {array}')