In Kruskal, in every iteration, an edge of the most minimum weight (greediest)

possible is selected and added to MST construction. Hence, greedy.

In Quick Sort, we partition the problem into subproblems, solve them and then
combine. Hence, it is Divide & Conquer.
Floyd-Warshall uses Dynamic programming

Strassen's matrix multiplication algorithm - Divide and Conquer

Kruskal's minimum spanning tree algorithm - Greedy method
Biconnected components algorithm - Depth first search
Floyd's shortest path algorithm - Dynamic programming