Algorithms illuminated (part 1) : the basics
Publication details: San Franscisco : Soundlikeyourself Publishing, ©2017Description: xii, 206 p. : ill. ; 26 cmISBN:- 9780999282908
- 005.73 ROU-A
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | Course reserves |
---|---|---|---|---|---|---|---|---|
![]() |
IIITD General Stacks | Computer Science and Engineering | 005.73 ROU-A (Browse shelf(Opens below)) | Checked out | 12/08/2025 | 013181 | ||
![]() |
IIITD Reference | Computer Science and Engineering | REF 005.73 ROU-A (Browse shelf(Opens below)) | Not for loan | 013182 |
Analysis and Design of Algorithms (Sec A & B) UG (SEM IV) WNT25 |
Browsing IIITD shelves, Shelving location: General Stacks, Collection: Computer Science and Engineering Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.73 LIP-D Schaum's outline of theory and problems of data structures | 005.73 LIP-D Schaum's outline of theory and problems of data structures | 005.73 NEC-D Data structures and algorithms using Python | 005.73 ROU-A Algorithms illuminated (part 1) : the basics | 005.73 ROU-A Algorithms illuminated (part 2) : graph algorithms and data structures | 005.73 ROU-A Algorithms illuminated (part 3) : greedy algorithms and dynamic programming | 005.73 SHA-D Data Structures using C |
Includes index
1. Introduction
2. Asymptotic Notation
3. Divde-and-conquer algorithms
4. The master method
5. Quicksort
6. Linear-time selection
There are no comments on this title.