Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

fixed big o #12

Merged
merged 1 commit into from
Dec 15, 2023
Merged

fixed big o #12

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 8 additions & 4 deletions Frontend/algoverse/src/components/infoContainer/applicationsText.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,8 @@
"Pathfinding in Games",
"Geographical Mapping",
"Network Routing"
]
],
"bigO":"Depending on the used data structure: [O((V + E) log V); O(V\u00B2)]"
},
"BFS": {
"description": "Finds the shortest paths from a source to all vertices in the given graph",
Expand All @@ -14,7 +15,8 @@
"Social Networking Features",
"Peer-to-Peer Networks",
"Garbage Collection Algorithms"
]
],
"bigO":"O(V + E)"
},
"DFS": {
"description": "Finds the shortest paths from a source to all vertices in the given graph",
Expand All @@ -23,7 +25,8 @@
"Path Finding in Sparse Graphs",
"Finding Strongly Connected Components",
"Generating Permutations"
]
],
"bigO": "O(V + E)"
},
"AStar": {
"description": "Finds the shortest paths from a source to all vertices in the given graph",
Expand All @@ -33,7 +36,8 @@
"Network Routing",
"Urban Planning and Geographic Information Systems (GIS)",
"Machine Learning"
]
],
"bigO": "Depending on the heuristic: [O(E) ; O(V\u00B2)] "
},"MergeSort": {
"description": "Merge sort is a divide-and-conquer algorithm that works by dividing an array into smaller subarrays, sorting each subarray, and then merging the sorted subarrays back together to form the final sorted array",
"applications": [
Expand Down