Maintained by Soumojit Shome
- Implementing Array
- Array Insertion
- Deletion Operation
2. Searching
- Linear Binary Search
| Search Name |
Best Time Complexity |
Average Time Complexity |
Worst Time Complexity |
Worst Space Complexity |
|---|---|---|---|---|
| Linear | O(1) | O(n) | O(n) | O(1) |
| Binary | O(1) | O(log n) | O(log n) | O(1) |
3. Sorting
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
- Merge Sort
- Count Sort
- Heap Sort
| Sort Name |
Best Time Complexity |
Average Time Complexity |
Worst Time Complexity |
Worst Space Complexity |
Stable | Adaptive |
|---|---|---|---|---|---|---|
| Bubble | O(n) | O(n^2) | O(n^2) | O(1) | Yes | Yes |
| Insertion | O(n) | O(n^2) | O(n^2) | O(1) | Yes | Yes |
| Selection | O(n^2) | O(n^2) | O(n^2) | O(1) | ||
| Quick | O(nlogn) | O(nlogn) | O(n^2) | O(logn) | Yes | |
| Merge | O(nlogn) | O(nlogn) | O(nlogn) | O(n) | Yes | |
| Heap | O(nlogn) | O(nlogn) | O(nlogn) | O(n) |
4. Stack
- Stack Using Array
- Stack Operations
- Peek Operations
- Stack Using Linked List
- Infix To Postfix Using Stack
5. Queue
- Queue Operations
- Circular Queue
- Queue Using Linked Lists
6. Linked List
- Singly Linked List
- Insertion
- Deletion
- Circular Linked List
- Doubly Linked List
7. Trees
- Linked Representation
- Preorder Traversal Binary Tree
- Postorder Traversal Binary Tree
- InOrder Traversal in a Binary Tree
- Checking if a binary tree is a binary search tree or not!
- Searching in a Binary Search Trees
- Iterative Search
- Insertion in a Binary Search Tree
- Deletion in a Binary Search Tree
- AVL Tree
8. Graph
- BFS Breadth First Search
- DFS Depth First Search
9. Hashing
- Hashing