The present work studies the problem of sorting using comparisons involving three elements at a time. Each comparison only identifies the smallest, middle, and largest elements among the three. We propose an algorithm based on six heuristic strategies, aiming to minimize the number of comparisons in the worst case. We report optimal or near-optimal results for all values up to \(n=40\) elements, and for selected instances up to \(n=1000\).