Algorithm and Design Complexity

By: Anli Sherine, Mary Jasmine, Geno Peter

Write A Review

Hardcover | 4 May 2023 | Edition Number 1

At a Glance

Hardcover
198 Pages

Dimensions(cm)
23.39 x 15.6 x 1.27

Hardcover

$498.99

or 4 interest-free payments of $124.75 with

Ships in 10 to 15 business days

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, and backtracking.

Features:

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.

This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.