Conference Paper

Tweaking for Better Algorithmic Implementation

2017 International Conference on Computer Applications inIndustry and Engineering
Ziping Liu, Zirou Qiu, Xuesong Zhang

ABSTRACT


 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.

CAINE 2017



ISBN:
978-1-943436-04-0
PUBLISHER:
ISCA
CHIEF EDITOR:
Waheed
CONFERENCE VENUE:
San Diego, California, USA
CONTACT DETAILS:
Debnath
Copyright © Search Innovations. All rights reserved