A Methodological Review for the Analysis of Divide and Conquer Based Sorting/ Searching Algorithms
This paper develops a practical methodology for the analysis of sorting/searching algorithms. To achieve this objective an analytical study of Quicksort and searching problem was undertaken. This work explains that asymptotic analysis can be misleading if applied slovenly. The study provides a fresh insight into the working of Quicksort and Binary search. Also this presents an exact analysis of Quicksort. Our study finds that asymptotic analysis is a sort of approximation and may hide many useful facts. It was shown that infinite inefficient algorithms can easily be classified with a few efficient algorithms using asymptotic approach.
Keywords: Sorting , Searching
Download Full-Text
ABOUT THE AUTHORS
Deepak Abhyankar
Software Engineer School of Computer Science & Information Technology Devi Ahilya University Indore M. P.
Maya Ingle
Prof. School of Computer Science & Information Technology Devi Ahilya University Indore M. P.
Deepak Abhyankar
Software Engineer School of Computer Science & Information Technology Devi Ahilya University Indore M. P.
Maya Ingle
Prof. School of Computer Science & Information Technology Devi Ahilya University Indore M. P.