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, Department of CSE, Bangladesh University of Engineering and Technology, for his constant...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Lutfor, Abu Sa-Adat Mohammed Moinul Hasan, Islam, Md. Shahidul, Dey, Arup Kanti
Hizkuntza:ingelesa
Argitaratua: Military Institute of Science and Technology 2015
Gaiak:
Sarrera elektronikoa:http://hdl.handle.net/123456789/185
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Antzeko izenburuak: Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort