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,...

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autori: Bari Khan, Imdadul, Nahar, Mst. Naznin, Islam, Farzina
Format: Disertacija
Jezik:engleski
Izdano: Department of Computer Science and Engineering, Military Institute of Science and Technology 2015
Teme:
Online pristup:http://hdl.handle.net/123456789/156
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!

Slični predmeti: Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort