TY  - BOOK
AU  - Bhasin,Harsh‏.
TI  - Algorithms: design and analysis 
SN  - 9780199456666
U1  - 005.1 22
PY  - 2015///
CY  - New Delhi
PB  - Oxford University Press
KW  - Computer algorithms
KW  - BUEsh
KW  - Design
KW  - ENGGEN
KW  - August 2016	
N1  - Index : p.685-690; Bibliography : p. 681-684; CHAPTER 1 INTRODUCTION TO ALGORITHMS -- CHAPTER 2 GROWTH OF FUNCTIONS -- CHAPTER 3 RECURSION -- CHAPTER 4 ANALYSIS OF ALGORITHMS -- CHAPTER 5 BASIC DATA STRUCTURES -- CHAPTER 6 TREES -- CHAPTER 7 GRAPHS -- CHAPTER 8 SORTING IN LINEAR AND QUADRATIC TIME -- CHAPTER 9 DIVIDE AND CONQUER -- CHAPTER 10 GREEDY ALGORITHMS -- CHAPTER 11 DYNAMIC PROGRAMMING -- CHAPTER12 BACKTRACKING -- CHAPTER 13 BRANCH AND BOUND -- CHAPTER 14 RANDOMIZED ALGORITHMS -- CHAPTER 15 TRANSFORM AND CONQUER -- CHAPTER 16 DECREASE AND CONQUER -- CHAPTER 17 NUMBER THEORETIC ALGORITHMS -- CHAPTER 18 STRING MATCHING -- CHAPTER 19 COMPLEXITY CLASSES -- CHAPTER 20 AN INTRODUCTION TO PSPACE -- CHAPTER 21 APPROXIMATION ALGORITHMS -- CHAPTER 22 PARALLEL ALGORITHMS -- CHAPTER 23 AN INTRODUCTION TO MACHINE LEARNING APPROACHES ; CHAPTER 24 COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
UR  - https://india.oup.com/orcs/9780199456666/
ER  -