Get Free Shipping on orders over $79
Algorithm and Design Complexity - Anli Sherine

Algorithm and Design Complexity

By: Anli Sherine, Mary Jasmine, Geno Peter, S. Albert Alexander

eText | 4 May 2023 | Edition Number 1

At a Glance

eText


$102.29

or 4 interest-free payments of $25.57 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

Other Editions and Formats

Paperback

Published: 19th December 2024

More in Systems Analysis & Design

Quantum Computing - Alex Wood

eBOOK

Think Distributed Systems - Dominik Tornow

eBOOK