Data Structures and Algorithms - Performance Analysis of Algorithms and Recurrences
- Option : B
- Explanation : Time complexty is O (nlogn) C * 64 log 64 = 30 (C = 5/14) for 6 minuts 5/64 * n log n 6 * 60 ⇒ [n = 512]
119. Match the pairs in the following:
| List-I | List-II | ||
| A. | Straseen's matrix multiplication algorithm | P. | Greedymethod |
| B. | Kruskal's minimum spanning tree algorithm | Q. | Dynamic programming |
| C. | Biconnected components algorithm | R. | Divide and Conquer |
| D. | Floyd's shortest path algorithm | S. | Depth first search |
