Useful-College-Projects/quicksort.py at main · SpooderManEXE/Useful-College-Projects · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
def partition(arr,low,high):
    i = (low-1)
    pivot = arr[high]

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

    arr[i+1],arr[high] = arr[high],arr[i+1]
    return(i+1)


def quickSort(arr,low,high):
    if(low < high):
        pi = partition(arr,low,high)

        quickSort(arr,low,pi-1)
        quickSort(arr,pi+1,high)


arr = []

for i in range(5):
    b = int(input())
    arr.append(b)

n = len(arr)
quickSort(arr,0,n-1)
print("sorted array is",arr)
def partition(arr,low,high):
    i = (low-1)
    pivot = arr[high]

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

    arr[i+1],arr[high] = arr[high],arr[i+1]
    return(i+1)


def quickSort(arr,low,high):
    if(low < high):
        pi = partition(arr,low,high)

        quickSort(arr,low,pi-1)
        quickSort(arr,pi+1,high)


arr = []

for i in range(5):
    b = int(input())
    arr.append(b)

n = len(arr)
quickSort(arr,0,n-1)
print("sorted array is",arr)