Design and Analysis of Computer Algorithms

By Vishwajit K. Barbudhe

The book contains: main approaches to design and analysis of algorithms including important algorithms and data structures, and results in complexity and computability. The main contents are: review of algorithm analysis (search in ordered array, binary insertion sort, merge sort, worst-case and average-case time complexity, minimum complexity of sorting n elements for small n, 2-3 trees, asymptotic notation); divide and conquer algorithms (master theorem, integer multiplication, matrix multiplication, fast Fourier transform); graphs (breadth-first search, connected components, topological ordering, depth-first search, way from planar graphs to Robertson-Seymour theorem); dynamic programming. Searching and Traversal Techniques: Efficient non - recursive binary tree traversal algorithm, Disjoint set operations, union and find algorithms, Spanning trees.

• Format: Paperback
• Language: English
• ISBN: 6202529288
• ISBN13: 9786202529280
• Release Date: April 2020
• Publisher: LAP Lambert Academic Publishing
• Length: 248 Pages
• Weight: 0.81 lbs.
• Dimensions: 0.6" x 6.0" x 9.0"