Fundamentals of algorithm / Gilles Brassard, Paul Bratley
Material type:
TextPublication details: Pearson Education,Description: xix, 524 pISBN: - 9788131712443
- 511.8 B7367
Contents:
1. Preliminaries
2. Elementary algorithms
3. Asymptotic notation
4. Analysis algorithms
5. Some data structures
6. Greedy algorithms
7. Divide and conquer
8. Dynamic programming
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Books
|
UE-Central Library | 511.8 B7367 (Browse shelf(Opens below)) | Available | T1202 |
1. Preliminaries
2. Elementary algorithms
3. Asymptotic notation
4. Analysis algorithms
5. Some data structures
6. Greedy algorithms
7. Divide and conquer
8. Dynamic programming
There are no comments on this title.
Log in to your account to post a comment.
