https://github.com/aryamangithub/data-structures-and-algorithm
https://github.com/aryamangithub/data-structures-and-algorithm
Last synced: 8 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/aryamangithub/data-structures-and-algorithm
- Owner: aryamangithub
- Created: 2023-02-06T20:31:28.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-12-22T17:54:40.000Z (over 1 year ago)
- Last Synced: 2025-02-04T12:03:49.249Z (over 1 year ago)
- Language: C++
- Size: 230 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Data Structure And Algorithm
This repository contains all the coding problems I solved on platforms GFG and Leetcode.
## Data Structures in Big O Notation
| Data Structure | Add/Insert | Remove/Delete | Access/Get | Search/Contains | Space Complexity |
| --- | --- | --- | --- | --- | --- |
| Array | ```O(n)``` | ```O(n)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` |
| Set | ```O(logn)``` | ```O(logn)``` |``` -``` | ```O(logn)``` | ```O(n)``` |
| Unordered Set | ```O(1)Average O(n)Worst``` | ```O(1)Average O(n)Worst``` |``` -``` | ```O(1)Average O(n)Worst``` | ```O(n)``` |
| Map | ```O(logn)``` | ```O(logn)``` |``` -``` | ```O(logn)``` | ```O(n)``` |
| Unordered Map | ```O(1)Average O(n)Worst``` | ```O(1)Average O(n)Worst``` |``` -``` | ```O(1)Average O(n)Worst``` | ```O(n)``` |
| Stack | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| Queue | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| Binary Search Tree | ```O(log n)``` | ```O(log n)``` | ```O(log n)``` | ```O(log n)``` | ```O(n)``` |
| Binary Min Heap | ```O(log n)``` | ```O(log n)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` |
| Binary Max Heap | ```O(log n)``` | ```O(log n)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` |
## Sorting Algorithms in Big O Notation
| Sort Algorithm | Best | Average | Worst | Space Complexity |
| --- | --- | --- | --- | --- |
| Selection Sort | ```O(n^2)``` | ```O(n^2)``` | ```O(n^2)``` | ```O(1)``` |
| Bubble Sort | ```O(n^2)``` | ```O(n^2)``` | ```O(n^2)``` | ```O(1)``` |
| Insertion Sort | ```O(n)``` | ```O(n^2)``` | ```O(n^2)``` | ```O(1)``` |
| Quick Sort | ```O(n logn)``` | ```O(n logn)``` | ```O(n^2)``` | ```O(logn)``` |
| Merge Sort | ```O(n logn)``` | ```O(n logn)``` | ```O(n logn)``` | ```O(n)``` |
| Counting Sort | ```O(n+k)``` | ```O(n+k)``` | ```O(n+k)``` | ```O(k)``` |
| Tim Sort | ```O(n)``` | ```O(n logn)``` | ```O(n logn)``` | ```O(n)``` |
| Heap Sort | ```O(n long)``` | ```O(n logn)``` | ```O(n logn)``` | ```O(1)``` |
| Shell Sort | ```O(n)``` | ```O((n logn)^2)``` | ```O((n logn)^2)``` | ```O(1)``` |
| Bucket Sort | ```O(n+k)``` | ```O(n+k)``` | ```O(n^2)``` | ```O(1)``` |
| Radix Sort | ```O(nk)``` | ```O(nk)``` | ```O(nk)``` | ```O(n+k)``` |