Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort
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,DepartmentofCSE,BangladeshUniversityofEngineeringand Technology, for his constant supervision,...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Tesi |
| Lingua: | inglese |
| Pubblicazione: |
Department of Computer Science and Engineering, Military Institute of Science and Technology
2015
|
| Soggetti: | |
| Accesso online: | http://hdl.handle.net/123456789/156 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1868227007097077760 |
|---|---|
| author | Bari Khan, Imdadul Nahar, Mst. Naznin Islam, Farzina |
| author_browse | Bari Khan, Imdadul Islam, Farzina Nahar, Mst. Naznin |
| author_facet | Bari Khan, Imdadul Nahar, Mst. Naznin Islam, Farzina |
| author_sort | Bari Khan, Imdadul |
| collection | DSpace |
| 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,DepartmentofCSE,BangladeshUniversityofEngineeringand 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. |
| format | Thesis |
| id | oai:localhost:123456789-156 |
| institution | My University |
| language | English |
| publishDate | 2015 |
| publishDateRange | 2015 |
| publishDateSort | 2015 |
| publisher | Department of Computer Science and Engineering, Military Institute of Science and Technology |
| publisherStr | Department of Computer Science and Engineering, Military Institute of Science and Technology |
| record_format | dspace |
| spelling | oai:localhost:123456789-1562015-08-04T08:22:38Z Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort Bari Khan, Imdadul Nahar, Mst. Naznin Islam, Farzina Optimizing, Divide, Conquer, Algorithms 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,DepartmentofCSE,BangladeshUniversityofEngineeringand 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. 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 approachdividesaproblemintotwosubproblemsrecursively. Thethesisshowsthatternary 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’. Department of Computer Science and Engineering, Military Institute of Science and Technology 2015-07-06T07:40:01Z 2015-07-06T07:40:01Z 2013-12 Thesis http://hdl.handle.net/123456789/156 en B.Sc. in Computer Science and Engineering Thesis; application/pdf Department of Computer Science and Engineering, Military Institute of Science and Technology |
| spellingShingle | Optimizing, Divide, Conquer, Algorithms Bari Khan, Imdadul Nahar, Mst. Naznin Islam, Farzina Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort |
| title | Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort |
| title_full | Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort |
| title_fullStr | Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort |
| title_full_unstemmed | Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort |
| title_short | Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort |
| title_sort | optimizing divide and conquer based algorithms the case of heapsort |
| topic | Optimizing, Divide, Conquer, Algorithms |
| url | http://hdl.handle.net/123456789/156 |
| work_keys_str_mv | AT barikhanimdadul optimizingdivideandconquerbasedalgorithmsthecaseofheapsort AT naharmstnaznin optimizingdivideandconquerbasedalgorithmsthecaseofheapsort AT islamfarzina optimizingdivideandconquerbasedalgorithmsthecaseofheapsort |