From de8c5cbf006863cf386741cc19b250bd048f96bb Mon Sep 17 00:00:00 2001 From: JakeBonek Date: Tue, 16 Aug 2016 12:56:38 -0400 Subject: [PATCH] Fixed typos --- sorts/bogosort.py | 4 ++-- sorts/heap_sort.py | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/sorts/bogosort.py b/sorts/bogosort.py index 5abdab87d..b8cb5b31b 100644 --- a/sorts/bogosort.py +++ b/sorts/bogosort.py @@ -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: python -m doctest -v bogosort.py or @@ -12,7 +12,7 @@ from __future__ import print_function import random 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 comparable items inside :return: the same collection ordered by ascending diff --git a/sorts/heap_sort.py b/sorts/heap_sort.py index 4c6026b8b..6d731cd4b 100644 --- a/sorts/heap_sort.py +++ b/sorts/heap_sort.py @@ -2,9 +2,9 @@ This is a pure python implementation of the heap sort algorithm. For doctests run following command: -python -m doctest -v insertion_sort.py +python -m doctest -v heap_sort.py or -python3 -m doctest -v insertion_sort.py +python3 -m doctest -v heap_sort.py For manual testing run: python insertion_sort.py