| nist.gov | Dictionary of all computer algorithms |
| bigocheatsheet.com | Complexity of all Data Structure Operations |
| usfca.edu | Data structure visualizations |
| rob-bell.net | Big O simplified:O (1), O (N), O (N^2), O (2^N)    Big O describes theWorst-Case scenario, can be used to describe theExecution Time or theSpace Used |
| github.com | All Abstract Data Types and relative algorithms |
| github.comgithub.com | Stack |
| github.comgithub.com | Queue |
| github.com | Linked list |
| github.comusfca.edu | Binary search tree (BST)  NOTES |
| github.com | Liner/Binary Search |
| github.com | Bubble/Selection/Insertion Sort    |
| geeksforgeeks.com | Sorting 1 million integers using counting sort |
| wikipedia.org | Skip List for faster traversal by maintaining a linked hierarchy of subsequencesConcurrentSkipListSet/ConcurrentSkipListMap in Java are based on Skip List |
| github.com | Bit wise And (&) for finding Even/Odd numbers |
| github.com | Prime numbers using square root (SQRT) |
| quora.com | Difference between Binary Tree and Red Black TreeRed Black Tree will reorganise itself so that you will always get O(log(N)) complexity |
| github.comgithub.com | Anagram in Java/Scala |
| github.comgithub.com | Word frequency in a statement in Java/Scala |
| ericsink.comstackoverflow.com | Graph: structure consisting of nodes, that are connected to each other with edgesDirected: the connections between the nodes (edges) have a direction: A -> B is not the same as B -> AAcyclic: "non-circular" = moving from node to node by the edges, and never encounter the same node againDirected Acyclic Graphs (DAG):- Their edges show direction
- They don't have cycles
|
Big O describes theWorst-Case scenario, can be used to describe theExecution Time or theSpace Used
NOTES
