sorts.patience_sort
===================

.. py:module:: sorts.patience_sort


Attributes
----------

.. autoapisummary::

   sorts.patience_sort.user_input


Classes
-------

.. autoapisummary::

   sorts.patience_sort.Stack


Functions
---------

.. autoapisummary::

   sorts.patience_sort.patience_sort


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

.. py:class:: Stack

   Bases: :py:obj:`list`


   Built-in mutable sequence.

   If no argument is given, the constructor creates a new empty list.
   The argument must be an iterable if specified.


   .. py:method:: __eq__(other)

      Return self==value.



   .. py:method:: __lt__(other)

      Return self<value.



.. py:function:: patience_sort(collection: list) -> list

   A pure implementation of patience sort algorithm in Python

   :param collection: some mutable ordered collection with heterogeneous
   comparable items inside
   :return: the same collection ordered by ascending

   Examples:
   >>> patience_sort([1, 9, 5, 21, 17, 6])
   [1, 5, 6, 9, 17, 21]

   >>> patience_sort([])
   []

   >>> patience_sort([-3, -17, -48])
   [-48, -17, -3]


.. py:data:: user_input