Algorithm and Design Complexity

by Anli Sherine, Geno Peter, Mary Jasmine

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. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming,...

• Format: Hardcover
• Language: English
• ISBN: 1032409320
• ISBN13: 9781032409320
• Release Date: May 2023
• Publisher: CRC Press
• Length: 182 Pages
• Weight: 1.00 lbs.
• Dimensions: 0.5" x 6.1" x 9.2"