The design technique used by the Selection Sort algorithm is an example of:

Selection sort operates by repeatedly finding the minimum element from the unsorted portion and placing it at the beginning. This approach involves making a locally optimal choice at each step without reconsideration, which aligns with the Greedy method paradigm. It does not involve dividing subproblems like Divide-and-conquer, overlapping subproblems like Dynamic Programming, or exploring paths via backtracking. Thus, the Greedy method is the correct classification for Selection sort's design technique.