* Get Bit: Make more terse
* Power of two: Allowed 1 as a valid power of 2.
Power of two: Removed unnecessary exception throwing.
* Fisher Yates: Made more terse
* Least Common Multiple: Fill undefined value
* Greatest Common Divisor: Fill undefined value.
Greatest Common Divisor: Make more terse.
* Fix LinkedList
* Fix the prepend method for the LinkedList
* Fix the remove method for the MinHeap
* Correct a comment
* Fix BST removal method
* Fix the findEdge method of the graph
* Fix the value returned by DisjointSet union
* Add recursive factorial function
* Fix the insertion sort
* Fix LinkedList
* Fix the prepend method for the LinkedList
* Fix the remove method for the MinHeap
* Correct a comment
* Fix BST removal method
* Fix the findEdge method of the graph
* Fix the value returned by DisjointSet union
* Add recursive factorial function
* Fix LinkedList
* Fix the prepend method for the LinkedList
* Fix the remove method for the MinHeap
* Correct a comment
* Fix BST removal method
* Fix the findEdge method of the graph
* Fix the value returned by DisjointSet union
* Fix LinkedList
* Fix the prepend method for the LinkedList
* Fix the remove method for the MinHeap
* Correct a comment
* Fix BST removal method
* Fix the findEdge method of the graph