Tweaking for Better Algorithmic Implementation

Small changes in the implementations of a classic algorithm sometimes can improve its performance. In this paper, tweaking for better algorithmic implementation is discussed over heap sort algorithm and Hierholzer’s algorithm. In heap sort algorithm, a new way to heapify is introduced, in which constant elements’ swapping is avoided when elements are moved to their correct positions in the binary tree. In the new proposed implementation for Hierholzer’s algorithm, searching the Euler circuit is started with the vertex of the highest indegrees (or outdegree) instead of a random pick. The paper proves that the performance of both algorithms is improved with the proposed tweaked implementations.