FilesExpand file tree

 master

/

quick_sort_3_partition.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

25 lines (23 loc) · 772 Bytes

 master

/

quick_sort_3_partition.py

Copy path

Top

File metadata and controls

• Code
• Blame

25 lines (23 loc) · 772 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 quick_sort_3partition(sorting, left, right):

if right <= left:

return

a = i = left

b = right

pivot = sorting[left]

while i <= b:

if sorting[i] < pivot:

sorting[a], sorting[i] = sorting[i], sorting[a]

a += 1

i += 1

elif sorting[i] > pivot:

sorting[b], sorting[i] = sorting[i], sorting[b]

b -= 1

else:

i += 1

quick_sort_3partition(sorting, left, a - 1)

quick_sort_3partition(sorting, b + 1, right)

if __name__ == "__main__":

user_input = input("Enter numbers separated by a comma:\n").strip()

unsorted = [int(item) for item in user_input.split(",")]

quick_sort_3partition(unsorted, 0, len(unsorted) - 1)

print(unsorted)