Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort