sorts.unknown_sort

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)

Attributes

user_input

Functions

merge_sort(collection)

Pure implementation of the fastest merge sort algorithm in Python

Module Contents

sorts.unknown_sort.merge_sort(collection)

Pure implementation of the fastest merge sort algorithm in Python

Parameters:

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]

sorts.unknown_sort.user_input