Performance Study of Logically-Modified Heap Sort Algorithm - Abhijeet Ashri,Mohit Aggarwal,Akhil V. Raj,Bhanu Prakash Lohani,Pradeep K. Kushwaha
Abhijeet Ashri, Mohit Aggarwal, Akhil V. Raj, Bhanu Prakash Lohani, Pradeep K. Kushwaha
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
Research Paper (undergraduate) from the year 2014 in the subject Computer Science - Theory, grade: 66.2, , course: Bachelor in Technology, language: English, abstract: Algorithms today are in great need, specially the one's having speed-up the process of what they are supposed to do. Making the algorithm run faster, or take up less space while executing is what many coders & designers have tried doing f ... Full description
You May Also Like
Description
Research Paper (undergraduate) from the year 2014 in the subject Computer Science - Theory, grade: 66.2, , course: Bachelor in Technology, language: English, abstract: Algorithms today are in great need, specially the one's having speed-up the process of what they are supposed to do. Making the algorithm run faster, or take up less space while executing is what many coders & designers have tried doing for generations. And the reason is due to the technological advancements in the real-world. We have tried our best to speed-up the process of heap sort, by logically modifying the algorithm. It's just a start, so the positives & negatives are welcome regarding our paper.
More Information
| Author | Abhijeet Ashri, Mohit Aggarwal, Akhil V. Raj, Bhanu Prakash Lohani, Pradeep K. Kushwaha |
|---|---|
| Publisher | GRIN Verlag |
| Release year | 2014 |
| Cover type | Softcover |
| EAN | 9783656846482 |