Algorithm and Design Complexity

Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time space trade-off, symptotic notations and so forth.

List of contents

1. Algorithm Analysis. 2. Divide and Conquer. 3. Dynamic programming. 4. Backtracking. 5. Graph.

About the author

Anli Sherine, S. Albert Alexander

Summary

Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time space trade-off, symptotic notations and so forth.

Product details

• Authors: S. Albert Alexander, Mary Jasmine, Geno Peter, Anli Sherine, Anli (University of Technology Sarawak Sherine
• Publisher: Taylor & Francis Ltd.
• Languages: English
• Product format: Hardback
• Released: 04.05.2023
• EAN: 9781032409320
• ISBN: 978-1-0-3240932-0
• No. of pages: 182
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > General, dictionaries; COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, computer science, algorithms and data structures, Algorithms & data structures