
M. A. Eldosuky Algorithm Analysis & Design
This introductory book defines what an algorithm is, and shows how to measure performance and compare algorithms using asymptotic notation. It shows how to analyze algorithms by solving recurrences using substitution, recursiontree and master theorem.
This book formulates sorting problems, and discusses sorting algorithms such as Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick sort, Heap sort, and Linear Time sorting. It shows graph representation and graph traversal algorithms such as Breadthfirst search and Depthfirst search. It introduces dynamic programming, then shows useful applications
The book also covers designing algorithms and advanced topics such as Comparative computing, Parallel algorithms and Heuristics.
This book formulates and discusses sorting algorithms such as Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick sort, Heap sort, and Linear Time sorting. It shows graph representation and graph traversal algorithms. It introduces dynamic programming, then shows useful applications
M. A. Eldosuky Algorithm Analysis & Design
M. A. Eldosuky Algorithm Analysis & Design
This introductory book defines what an algorithm is, and shows how to measure performance and compare algorithms using asymptotic notation. It shows how to analyze algorithms by solving recurrences using substitution, recursiontree and master theorem.