Strictly speaking, that approach would help you find a heuristically good algorithm, but not necessarily the optimal one. Those are very different.
Insertion sort is heuristically good in many practical circumstances. You wouldn't call it optimal, nor choose to use it as your general-purpose sorting algorithm.