Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort

MIST Central Library Repository

Show simple item record

dc.contributor.author Lutfor, Abu Sa-Adat Mohammed Moinul Hasan
dc.contributor.author Islam, Md. Shahidul
dc.contributor.author Dey, Arup Kanti
dc.date.accessioned 2015-08-30T07:54:40Z
dc.date.available 2015-08-30T07:54:40Z
dc.date.issued 2013-12
dc.identifier.uri http://hdl.handle.net/123456789/185
dc.description We are thankful to Almighty Allah for His blessings for the successful completion of our thesis. Our heartiest gratitude, profound indebtedness and deep respect go to our supervisor Dr. MKaykobad, Professor, Department of CSE, Bangladesh University of Engineering and Technology, for his constant supervision, affectionate guidance and great encouragement and motivation. His keen interest on the topic and valuable advices throughout the study was of great help in completing our thesis. We are especially grateful to the Department of Computer Science and Engineering (CSE) of Military Institute of Science and Technology (MIST) for providing their all out support during the thesis work. Finally, we would like to thank our families and our course mates for their appreciable assistance, patience and suggestions during the course of our thesis. en_US
dc.description.abstract The divide and conquer approach is very useful in computer science applications. With this approach a large problem is broken down into small and manageable subproblems and each is solved separately. Then these solutions are combined to give the final solution to the problem. This paper presents a discussion on the divide and conquer based techniques for various sorting algorithm with special emphasis on heap sort. Most divide and conquer approach divides a problem into two subproblems recursively. The thesis shows that ternary systems are more promising than the more traditional binary systems used in the divide and conquer approach. In particular, heap on ternary tree does indicate some theoretical advantages over the more established binary systems. The paper also makes an endeavour to present a set of simulations with random numbers for both integers and floating point numbers to support our theoretically proven claim. For doing so, at first algorithm for conventional binary heapsort has been modified for three and four child heapsort. Thereafter, the paper finds out number of comparisons required, number of movements required and time taken for all the three systems. Experimental results clearly state that in most cases three child heasort demonstrates better performance than both binary and four child version of heapsort. The experimental data with graphical representation have also been presented to support the analysis. This experiment can surely be a guide to establish more promising ternary system in applications related to divide and conquer technique with the motivation- ‘A little advantage in optimization can be proven very useful in implementation of large systems’. en_US
dc.description.sponsorship Department of Computer Science and Engineering Military Institute of Science and Technology en_US
dc.language.iso en en_US
dc.publisher Military Institute of Science and Technology en_US
dc.subject Optimizing, Conquer, Based, Algorithms, Heapsort en_US
dc.title Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account