* Fractional Knapsack Algorithm

* Longest Palindrome Substring Algorithm

Create GCD.py

iterative mergesort added

This effectively standardizes the function arguments for all the new
sorting algorithms to be consistent with the other ones. Also fixes a few
bugs and performs some style improvements, such as moving documentation
of functions to after the function definition instead of before, and
adding documentation where it is missing.

This verifies that sorting algorithms are either entirely inplace or
do not modify the list and return a copy. Furthermore, this standardizes
how they handle empty lists.

* Create brick_sort.py

* Create tim_sort.py

* Create cocktail_sort.py

* Create gnome_sort.py

* Update cocktail_sort.py

* Update cocktail_sort.py

* Update cocktail_sort.py

* Update cocktail_sort.py

* Update cocktail_sort.py

* Update gnome_sort.py

* Update tim_sort.py

* Update tim_sort.py

* Suggestion for changes in the WeightedGraph class

* Suggestion for changes in the WeightedGraph class

* Fixed sieve
- Algo now printing n when if prime
- updated tests

* Removed extra 'this'

Update heap_sort.py

Added explanation for how heap-sort works and corresponds to the method heapify().

Add insert and count-nodes

I added insert and counting-node functions for BinaryTree and BinarySearchTree

Refactor

Minor Updates