The 'Median of Three' is a strategy used in quicksort algorithms to select a pivot element that minimizes the chance of encountering the worst-case scenario, thereby improving the algorithm's efficiency. By choosing the median value among the first, middle, and last elements of the array, it balances the partition sizes more effectively than simply picking the first or last element.