sorts.comb_sort

This is pure Python implementation of comb sort algorithm. Comb sort is a relatively simple sorting algorithm originally designed by Wlodzimierz Dobosiewicz in 1980. It was rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort algorithm. In bubble sort, distance (or gap) between two compared elements is always one. Comb sort improvement is that gap can be much more than 1, in order to prevent slowing down by small values at the end of a list.

More info on: https://en.wikipedia.org/wiki/Comb_sort

For doctests run following command: python -m doctest -v comb_sort.py or python3 -m doctest -v comb_sort.py

For manual testing run: python comb_sort.py

Attributes

user_input

Functions

comb_sort(→ list)

Pure implementation of comb sort algorithm in Python

Module Contents

sorts.comb_sort.comb_sort(data: list) → list

Pure implementation of comb sort algorithm in Python :param data: mutable collection with comparable items :return: the same collection in ascending order Examples: >>> comb_sort([0, 5, 3, 2, 2]) [0, 2, 2, 3, 5] >>> comb_sort([]) [] >>> comb_sort([99, 45, -7, 8, 2, 0, -15, 3]) [-15, -7, 0, 2, 3, 8, 45, 99]

sorts.comb_sort.user_input