Description
Includes complete coverage of basics and design of algorithms
Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics
Provides time and space complexity tutorials
Reviews combinatorial optimization of Knapsack problem
Simplifies recurrence relation for time complexity
Book Information
ISBN 9781032409320
Author Anli Sherine
Format Hardback
Page Count 182
Imprint Taylor & Francis Ltd
Publisher Taylor & Francis Ltd