Fundamentals of Computer Algorithms by Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran
Material type:
Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
![]() |
Institute of Technology | General | 005.1 HOR (Browse shelf(Opens below)) | Available | T0011964 | |||
![]() |
Institute of Technology | General | 005.1 HOR (Browse shelf(Opens below)) | Binding Damaged | In a Binding Process | T0011965 | ||
![]() |
Institute of Technology | General | 005.1 HOR (Browse shelf(Opens below)) | Available | T0011966 | |||
![]() |
Institute of Technology | General | 005.1 HOR (Browse shelf(Opens below)) | Available | T0011967 | |||
![]() |
Institute of Technology | Reference | 005.1 HOR (Browse shelf(Opens below)) | Not For Loan | T0011963 |
Total holds: 0
Introduction Elementary Data Structures Divide and Conquer The Greedy Method Dynamic Programming Basic Traversal and Search Techniques Backtracking Branch and Bound Algebraic Problems Lower Bound Theory NP Hard and NP Complete Problems Approximation Algorithms Pram Algorithms Mesh Algorithms Hypercube Algorithms Index
There are no comments on this title.