mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 17:06:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

comb_sort: fix typo and indentation

Browse Source
This commit is contained in:
Kelvin Salton do Prado 2018-10-01 23:46:47 -03:00
parent 5fb6b31ea9
commit f4a80fbfcb
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
sorts/comb_sort.py
View File

@ -2,7 +2,7 @@
Comb sort is a relatively simple sorting algorithm originally designed by Wlodzimierz Dobosiewicz in 1980. Comb sort is a relatively simple sorting algorithm originally designed by Wlodzimierz Dobosiewicz in 1980.
Later it was rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort. Later it was rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort.
This is pure python implementation of counting sort algorithm This is pure python implementation of comb sort algorithm
For doctests run following command: For doctests run following command:
python -m doctest -v comb_sort.py python -m doctest -v comb_sort.py
or or
@ -31,7 +31,7 @@ def comb_sort(data):
i = 0 i = 0
while gap > 1 or swapped: while gap > 1 or swapped:
# Update the gap value for a next comb # Update the gap value for a next comb
gap = int(float(gap) / shrink_factor) gap = int(float(gap) / shrink_factor)
swapped = False swapped = False
@ -39,7 +39,7 @@ def comb_sort(data):
while gap + i < len(data): while gap + i < len(data):
if data[i] > data[i+gap]: if data[i] > data[i+gap]:
# Swap values # Swap values
data[i], data[i+gap] = data[i+gap], data[i] data[i], data[i+gap] = data[i+gap], data[i]
swapped = True swapped = True
i += 1 i += 1