Algorithm and Design Complexity by Anli Sherine, Mary Jasmine... - 9781032409351

Algorithm and Design ComplexityAuthor(s): Anli Sherine, Mary Jasmine, Geno Peter, S. Albert Alexander\nFormat: Paperback\nPublisher: Taylor & Francis Ltd, United Kingdom\nImprint: CRC Press\nISBN-13: 9781032409351, 978-1032409351\nSynopsis\nComputational 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, and backtracking.\n\nFeatures:\n\nIncludes complete coverage of basics and design of algorithms\n\nDiscusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics\n\nProvides time and space complexity tutorials\n\nReviews combinatorial optimization of Kna.