Puts a given item into Queue

Pushes a given item into Stack

O(log n) function for pow(x, y)

BinPow evaluates (base ^ deg) % rem

GCD returns gcd of x and y

using recursion

* O(n) solution for calculating maximum subarray sum. */

PrimesUpTo finds all prime numbers from 1 to upperBound It's implemented using eratosthenes sieve Works in O(upperBound) time and space

* * Heap sort - https://en.wikipedia.org/wiki/Heapsort */

Extracts first item from the Queue

* * Merge sort - http://en.wikipedia.org/wiki/Merge_sort */

Initialzes new Stack

Initializes new Queue and return it

Deletes top of a stack and return it

* * Counting sort - https://en.wikipedia.org/wiki/Counting_sort */

inorder traversal algorithm Copies the elements of the bst to the array in sorted order

insert nodes into a binary search tree

allocating a new node

* * Bubble sort - http://en.wikipedia.org/wiki/Bubble_sort */

* * Cocktail sort - https://en.wikipedia.org/wiki/Cocktail_sort */

* * Comb sort - https://en.wikipedia.org/wiki/Combsort */

* * Gnome sort - https://en.wikipedia.org/wiki/Gnome_sort */

* * Insertion sort - https://en.wikipedia.org/wiki/Insertion_sort */

* * Odd-Even sort - https://en.wikipedia.org/wiki/Odd-even_sort */

Peek returns top of a stack without deletion

* * Selection sort - http://en.wikipedia.org/wiki/Selection_sort */

* * Shell sort - http://en.wikipedia.org/wiki/Shellsort */

TestBinPow tests binpow function

TestFastPow tests fastpow function

TestGcd tests gcd

TestPrimeFinder tests prime finding

Testfactorial tests factorial function

tester