Kruskal's algorithm follows the greedy strategy. Divide and conquer splits problems into subproblems — used in quicksort, binary search, and Tower of Hanoi.
Was this answer helpful?
0
0
Top TS PGECET Computer Science & Information Technology Questions