Added big-o cheatsheet in refresher-3

RashikAnsar · Nov 8, 2018 · 30de4b7 · 30de4b7
1 parent ee57f57
commit 30de4b7
Showing 1 changed file with 4 additions and 2 deletions.
diff --git a/0.Refresher/03.refresher.md b/0.Refresher/03.refresher.md
@@ -40,8 +40,7 @@
 | Binary Heap        | --     | O(n)   | O(logn)   | O(logn)  |
 | Hash Table         | O(n)   | --     | O(n)      | O(n)     |
 
-> Note: In case of balanced binary search trees complexity is **_O(logn)_**
- > <br>In case of Perfect hash function of Hash Table then its complexity is **O(1)**
+> Note: In case of balanced binary search trees complexity is **_O(logn)_** > <br>In case of Perfect hash function of Hash Table then its complexity is **O(1)**
 
 | Sorting       | Best             | Average          | Worst            | Space Complexity |
 | ------------- | ---------------- | ---------------- | ---------------- | ---------------- |
@@ -67,3 +66,6 @@
 - **Edge** &rarr; Connection between two nodes
 - **Weighted/Unweighted** &rarr; Values assigned to distances between vertices
 - **Directed/Undirected** &rarr; Directions assigned to distanced between vertices
+
+<hr>
+[Big O CheatSheet](http://bigocheatsheet.com/)