Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/nachiket-072005/data_structure-algorithm
In this repo, I am uploading Data-Structure-and-Algorithm in Java with Step by step chapter code basics to advanced topics like DP, Graph and so on.
https://github.com/nachiket-072005/data_structure-algorithm
c data-structures java
Last synced: about 2 months ago
JSON representation
In this repo, I am uploading Data-Structure-and-Algorithm in Java with Step by step chapter code basics to advanced topics like DP, Graph and so on.
- Host: GitHub
- URL: https://github.com/nachiket-072005/data_structure-algorithm
- Owner: Nachiket-072005
- Created: 2023-04-12T13:27:10.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-07-30T15:15:38.000Z (6 months ago)
- Last Synced: 2024-07-30T19:11:18.884Z (6 months ago)
- Topics: c, data-structures, java
- Language: Java
- Homepage:
- Size: 19.1 MB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Data-Structures_AND_Algorithms
✨DSA using Java✨
# 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)``` |
| Singly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| Doubly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| Circular Singly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| Circular Doubly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| Stack | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| Queue | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |
| HashMap | ```O(1)``` | ```O(1)``` | ```O(1)``` | ```O(1)``` | ```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)``` |