This file was created by IntelliJ IDEA 12.1.4 for binding GitHub repository
Sample programs to study and practise algorithms
2013/06/26 Sieve of Eratosthenes Time Complexity: n(1/2 + 1/3 + 1/5 + 1/7 + ...) = O(n log log n), there is a sum of reciprocals of primes up to n involved
2013/07/05 Implement Stack with Arraylist Implement Stack with LinkedList basic functions of stack: push() pop() siz() isEmpty() peek()
Implement BlockingQueue with LinkedList basic functions: offer() poll() put() take()
2013/07/12 Implement MyQueue - simple queue using LinkedList basic functions: add() remove()
Implement MyHeap interface, then MyMaxHeap and MyMinHeap - implementing using ArrayList basic functions: siftUp() siftDown() add() remove()