Design and Analysis of Computer Algorithms

Vishwajit K. Barbudhe

ISBN 10: 6202529288 / ISBN 13: 9786202529280

Published by LAP LAMBERT Academic Publishing Apr 2020, 2020

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 248 pp. Englisch.

Seller Inventory # 9786202529280

Bibliographic Details

• Title: Design and Analysis of Computer Algorithms
• Publisher: LAP LAMBERT Academic Publishing Apr 2020
• Publication Date: 2020
• Language: English
• ISBN 10: 6202529288
• ISBN 13: 9786202529280
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 16D millimeters 220 millimeters width by 150 millimeters height by 16 millimeters depth
• Weight: 387 grams

About this title

Synopsis

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.