sorts.pancake_sort

This is a pure Python implementation of the pancake sort algorithm For doctests run following command: python3 -m doctest -v pancake_sort.py or python -m doctest -v pancake_sort.py For manual testing run: python pancake_sort.py

Attributes

T
user_input

Functions

pancake_sort(→ list[T])

Sort Array with Pancake Sort.

Module Contents

sorts.pancake_sort.pancake_sort[T](arr: collections.abc.Sequence[T]) → list[T]

Sort Array with Pancake Sort. :param arr: Collection containing comparable items :return: Collection ordered in ascending order of items Examples: >>> pancake_sort([0, 5, 3, 2, 2]) [0, 2, 2, 3, 5] >>> pancake_sort([]) [] >>> pancake_sort([-2, -5, -45]) [-45, -5, -2]

Time Complexity: (O(n^2)) Space Complexity: (O(n))

sorts.pancake_sort.T

sorts.pancake_sort.user_input