## 0.1.4 - sorter

- Merged [garroadran](https://github.com/garroadran) additions and changes. Changed sorts to sort a cloned list rather then in place.
- README.md updated to reflect [garroadran](https://github.com/garroadran) changes.
- UnitTests updated and working correctly.
- setup.py updated now at version 0.1.4.

Author: Brett

README.md

@@ -15,7 +15,8 @@ Sort Integers using different sorting algorithms!
 5. [Quick](https://en.wikipedia.org/wiki/Quicksort)
 6. [Radix](https://en.wikipedia.org/wiki/Radix_sort)
 7. [Insertion](https://en.wikipedia.org/wiki/Insertion_sort)
-8. [Heap](https://en.wikipedia.org/wiki/Heapsort)
+8. [Recursive Insertion](https://en.wikipedia.org/wiki/Insertion_sort)
+9. [Heap](https://en.wikipedia.org/wiki/Heapsort)
 
 #### Arguments
 
@@ -75,7 +76,8 @@ an array and checks it sorted iteratively, larger data sets will take a long tim
 
 ## Authors
 
-* **Brett Currie** - [becurrie](https://github.com/becurrie)
+* [**becurrie**](https://github.com/becurrie)
+* [**garroadran**](https://github.com/garroadran) - Heap, Insertion, Recursive Insertion algorithms.
 
 See also the list of [contributors](https://github.com/becurrie/py-custom-sorters/contributors) who participated in this project.
 

setup.py

@@ -4,7 +4,7 @@
     name='sorter',
     author_email='brettecurrie@gmail.com',
     author='becurrie',
-    version='0.1.3',
+    version='0.1.4',
     description='sort integers with different sorting algorithms.',
     packages=find_packages(),
     py_modules=['sorter.sorter'],

sorter/sorts.py

@@ -148,7 +148,7 @@ def quick_sort_partition(integers, first, last):
     return right
 
 
-  def counting_sort(integers, exp):
+def counting_sort(integers, exp):
     """Counting sort helper method used with the radix_sort()"""
     n = len(integers)
 
@@ -204,11 +204,13 @@ def insertion_sort(integers):
             integers_clone[j], integers_clone[j-1] = integers_clone[j-1], integers_clone[j]
             j -= 1
 
-        return integers_clone
+    return integers_clone
+
 
 def insertion_sort_recur(integers):
     """Performs insertion sort recursively."""
     integers_clone = list(integers)
+
     def helper(arr, n):
         if n > 0:
             helper(arr, n-1)
@@ -219,6 +221,7 @@ def helper(arr, n):
     helper(integers_clone, len(integers_clone) - 1)
     return integers_clone
 
+
 def heap_sort(integers):
     """Sorts elements by first building an array that fulfills the
     maxheap property. Once the original array has been modified
@@ -232,7 +235,7 @@ def heap_sort(integers):
     # Reorganize the array so that it has the maxheap property
     n = len(integers_clone)
     for i in range(n, -1, -1):
-        max_heapify(intgers_clone, i, n)
+        max_heapify(integers_clone, i, n)
 
     # Swap the biggest element with the last element in the array
     # Then fix the maxheap property on everything except the
@@ -245,6 +248,7 @@ def heap_sort(integers):
 
     return integers_clone
 
+
 def max_heapify(arr, i, n):
     """Corrects a violation of the maxheap property, provided the
     subtrees on the left and right of arr[i] are max heaps.

test.py

@@ -85,5 +85,5 @@ def test_insertion_recur(self):
 
     def test_heap_sort(self):
         """Test the heap sort function."""
-        integers = heap_sort(clone)
+        integers = heap_sort(self.actual)
         self.assertEqual(self.expected, integers)