Mobility & Industrial Operations — DS & Algo Case Studies
Ten sustainability-focused systems includes all movement, transport, automotive and manufacturing.
Data Structures & Algorithms — All 10 Business Cases
Clean summary table of algorithms and data structures used across the 10 Arohanagara business cases.
| Data Structure / Algorithm | Used? | Where Used? | Space Efficiency | Time Efficiency |
|---|---|---|---|---|
| Arrays | Yes | Cases 2,4,5,6,8,9 | O(n) | O(1) |
| Structures | Yes | Cases 1–10 | O(1) | O(1) |
| List | Yes | Case 3 | O(n) | O(1) append |
| Stack | No | - | - | - |
| Queue | Yes | Cases 1,4,6,8,9,10 | O(n) | O(1) |
| Binary Tree | No | - | - | - |
| Binary Search Tree | Yes | Case 7 | O(n) | O(log n) |
| AVL Tree | Yes | Case 5 | O(n) | O(log n) |
| Red-Black Tree | Yes | Cases 5,7 | O(n) | O(log n) |
| Trie | Yes | Case 5 | O(k) | O(k) |
| Heap | Yes | Cases 1,2,4,6,7,8,9,10 | O(n) | O(log n) |
| Lookup Table | Yes | Cases 1–10 | O(n) | O(1) |
| Sparse Table | Yes | Cases 6,8,9,10 | O(n log n) | O(1) |
| Fenwick Tree | Yes | Cases 2,6,10 | O(n) | O(log n) |
| Segment Tree | Yes | Cases 2,6,9,10 | O(n) | O(log n) |
| Skip List | Yes | Cases 5,7 | O(n) | O(log n) |
| Union-Find | Yes | Cases 3,4,8,9 | O(n) | O(α(n)) |
| Hashing | Yes | Cases 1–10 | O(n) | O(1) |
| DFS | Yes | Cases 4,8,9,10 | O(V+E) | O(V+E) |
| BFS | Yes | Cases 1,8,9,10 | O(V+E) | O(V+E) |
| Selection Sort | Yes | Case 4 | O(n²) | O(n²) |
| Insertion Sort | Yes | Case 4 | O(n²) | O(n²) |
| Quick Sort | Yes | Case 3 | O(n) extra | O(n log n) |
| Merge Sort | Yes | Case 3 | O(n) | O(n log n) |