FilesExpand file tree

 master

/

QuickSort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

25 lines (21 loc) · 909 Bytes

 master

/

QuickSort.py

Copy path

Top

File metadata and controls

• Code
• Blame

25 lines (21 loc) · 909 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

def quicksort(array, startIndex, endIndex):

if startIndex < endIndex:

middle = partition(array, startIndex, endIndex)

quicksort(array, startIndex, middle - 1)

quicksort(array, middle + 1, endIndex)

return array

def partition(array, startIndex, endIndex):

pivot = startIndex + (endIndex - startIndex) // 2;

pivotIndex = startIndex

array[pivot], array[endIndex] = array[endIndex], array[pivot]

for i in range(startIndex, endIndex):

if array[i] < array[endIndex]:

array[pivotIndex], array[i] = array[i], array[pivotIndex]

pivotIndex += 1

array[endIndex], array[pivotIndex] = array[pivotIndex], array[endIndex]

return pivotIndex

if __name__ == '__main__':

arr = [97, 200, 100, 101, 211, 107]

print("My array is:\n", [x for x in arr])

print("\nMy sorted array is: ")

print(quicksort(arr, 0, len(arr) - 1))