Fundamentals of algorithmics

Brassard, Gilles ;

Fundamentals of algorithmics - New Jersey : Prentice Hall, ©1996. - xix, 524 p. : illustrations ;

Included Index.

Preliminaries --
Elementary algorthmics --
Asymptotic notation --
Analysis of algorthms --
Some data structures --
Greedy algorithms --
Divide-and-conquer --
Dynamic programming --
Exploring graphs --
Probabilistic algorithms --
Parallel algorithms --
Computational complexity --
Heuristic and approximate algorithms.

This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application.

0133350681 9780133350685 013073487X 9780130734877


Algorithms.
Algorithms -- Problems, exercises, etc.

511.8 / BRA

© University of Vavuniya

---