The field of algorithms is now a well-established part of computer science and mathematics, with its theoretical elegance and practical importance. On the one hand, computer practitioners can directly use good algorithms in complex programming projects. On the other hand, efficient algorithms often pose a challenging mathematical problem because their analysis uses deep mathematical results from different fields. Thus the modern study of algorithms is based on an interplay between their computational and mathematical aspects. The goal of this book is to lay down foundations for this fascinating area. In keeping with this goal, we have attempted to present some of the most fundamental methods for algorithm construction. In particular, the book introduces a number of paradigms and techniques useful for designing and analyzing data structures and algorithms.

About the Author

Dejan �ivkovi� graduated mathematics at Belgrade University, Serbia, and he got his Ph.D. degree in computer science from Wesleyan University, Middletown, CT, USA. He is currently a Professor at Singidunum University, Serbia. His interests include algorithm complexity, graph theory, and programming languages.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

WRAP Ltd
Unit 4, 119 Loverock Rd, Reading, RG30 1DZ, United Kingdom

Sale & Shipping Terms

Terms of Sale

TBA

Shipping Terms

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.