sorts.unknown_sort
==================

.. py:module:: sorts.unknown_sort

.. autoapi-nested-parse::

   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
----------

.. autoapisummary::

   sorts.unknown_sort.user_input


Functions
---------

.. autoapisummary::

   sorts.unknown_sort.merge_sort


Module Contents
---------------

.. py:function:: 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]


.. py:data:: user_input