FilesExpand file tree

 master

/

quick_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

51 lines (41 loc) · 1.35 KB

 master

/

quick_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

51 lines (41 loc) · 1.35 KB

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

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

"""

This is a pure Python implementation of the quick sort algorithm

For doctests run following command:

python -m doctest -v quick_sort.py

or

python3 -m doctest -v quick_sort.py

For manual testing run:

python quick_sort.py

"""

def quick_sort(collection):

"""Pure implementation of quick sort algorithm in Python

:param collection: some mutable ordered collection with heterogeneous

comparable items inside

:return: the same collection ordered by ascending

Examples:

>>> quick_sort([0, 5, 3, 2, 2])

[0, 2, 2, 3, 5]

>>> quick_sort([])

[]

>>> quick_sort([-2, -5, -45])

[-45, -5, -2]

"""

length = len(collection)

if length <= 1:

return collection

else:

# Use the last element as the first pivot

pivot = collection.pop()

# Put elements greater than pivot in greater list

# Put elements lesser than pivot in lesser list

greater, lesser = [], []

for element in collection:

if element > pivot:

greater.append(element)

else:

lesser.append(element)

return quick_sort(lesser) + [pivot] + quick_sort(greater)

if __name__ == "__main__":

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

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

print(quick_sort(unsorted))