Analysis and design of algorithms
This book provides an exhaustive and comprehensive treatment of designing procedure of algorithms and how to analyze algorithms. It is intended primarily for use in undergraduate and postgraduate cources in data structures and algorithms.
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New Delhi
S.K. Kataria & Sons
2012
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000nam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | 50070 | ||
| 003 | MY-KLNDU | ||
| 005 | 20241219013222.0 | ||
| 008 | 131026s2012 ii a i 000 0 eng d | ||
| 020 | |a 9789350142479 | ||
| 039 | 9 | |a 201406171535 |b zul |c 201312091246 |d shahrim |c 201310261210 |d aiza |y 201310261200 |z aiza | |
| 040 | |a UPNM | ||
| 090 | |a QA 76.9 .A43 |b .R35 2012 | ||
| 100 | 1 | |a Rajput, Vinod Kumar | |
| 245 | 1 | 0 | |a Analysis and design of algorithms |c Vinod Kumar Rajput |
| 260 | |a New Delhi |b S.K. Kataria & Sons |c 2012 | ||
| 300 | |a 366 p. |b ill. |c 24 cm. | ||
| 500 | |a Includes index. | ||
| 505 | 0 | |a 1. Introduction -- 2. Elementary data structures -- 3. Sorting algorithms -- 4. Searching algorithms -- 5. Divide and conquer -- 6. The greedy method -- 7. Dynamic programming -- 8. Backtracking -- 9. Branch and bound -- 10. NP-hard and NP-complete problems | |
| 520 | |a This book provides an exhaustive and comprehensive treatment of designing procedure of algorithms and how to analyze algorithms. It is intended primarily for use in undergraduate and postgraduate cources in data structures and algorithms. | ||
| 592 | |a 00004311 |b 11/11/2013 |c RM69.13 |h PDW | ||
| 650 | 0 | |a Computer algorithms. | |
| 999 | |a vtls000050752 |c 50070 |d 50070 | ||