• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algorithm and Design Complexity

Algorithm and Design Complexity

Paperback

Technology & EngineeringGeneral ComputersGeneral Mathematics

ISBN10: 1032409355
ISBN13: 9781032409351
Publisher: CRC Press
Published: Dec 19 2024
Pages: 182
Weight: 0.63
Height: 0.42 Width: 6.14 Depth: 9.21
Language: English

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.

1 different editions

Also available

Also in

General Computers