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,...
Gardado en:
| Main Authors: | , , |
|---|---|
| Formato: | Thesis |
| Idioma: | inglés |
| Publicado: |
Department of Computer Science and Engineering, Military Institute of Science and Technology
2015
|
| Subjects: | |
| Acceso en liña: | http://hdl.handle.net/123456789/156 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
| Summary: | 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. |
|---|