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

Descripción completa

Detalles Bibliográficos

Autores principales:	Lutfor, Abu Sa-Adat Mohammed Moinul Hasan, Islam, Md. Shahidul, Dey, Arup Kanti
Lenguaje:	inglés
Publicado:	Military Institute of Science and Technology 2015
Materias:	Optimizing, Conquer, Based, Algorithms, Heapsort
Acceso en línea:	http://hdl.handle.net/123456789/185
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!