FilesExpand file tree

 Write-for-current-Python

/

unknown_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (32 loc) · 1.07 KB

 Write-for-current-Python

/

unknown_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (32 loc) · 1.07 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

"""

Python implementation of a sort algorithm.

Best Case Scenario : O(n)

Worst Case Scenario : O(n^2) because native Python functions:min, max and remove are

already O(n)

"""

def merge_sort(collection):

"""Pure implementation of the fastest merge sort algorithm in Python

:param collection: some mutable ordered collection with heterogeneous

comparable items inside

:return: a collection ordered by ascending

Examples:

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

[0, 2, 2, 3, 5]

>>> merge_sort([])

[]

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

[-45, -5, -2]

"""

start, end = [], []

while len(collection) > 1:

min_one, max_one = min(collection), max(collection)

start.append(min_one)

end.append(max_one)

collection.remove(min_one)

collection.remove(max_one)

end.reverse()

return start + collection + end

if __name__ == "__main__":

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

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

print(*merge_sort(unsorted), sep=",")