mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixed typos

Browse Source
This commit is contained in:
JakeBonek 2016-08-16 12:56:38 -04:00
parent e359b6efd4
commit de8c5cbf00
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sorts/bogosort.py
View File

@ -1,5 +1,5 @@
""" """
This is pure python implementation of the bogosort algorithm This is a pure python implementation of the bogosort algorithm
For doctests run following command: For doctests run following command:
python -m doctest -v bogosort.py python -m doctest -v bogosort.py
or or
@ -12,7 +12,7 @@ from __future__ import print_function
import random import random
def bogosort(collection): def bogosort(collection):
"""Pure implementation of bogosort algorithm in Python """Pure implementation of the bogosort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous :param collection: some mutable ordered collection with heterogeneous
comparable items inside comparable items inside
:return: the same collection ordered by ascending :return: the same collection ordered by ascending

4
sorts/heap_sort.py
View File

@ -2,9 +2,9 @@
This is a pure python implementation of the heap sort algorithm. This is a pure python implementation of the heap sort algorithm.
For doctests run following command: For doctests run following command:
python -m doctest -v insertion_sort.py python -m doctest -v heap_sort.py
or or
python3 -m doctest -v insertion_sort.py python3 -m doctest -v heap_sort.py
For manual testing run: For manual testing run:
python insertion_sort.py python insertion_sort.py