Algorithms: Design and Analysis
Harsh Bhasin · 2015
CHAPTER 1 INTRODUCTION TO ALGORITHMS CHAPTER 2 GROWTH OF FUNCTIONS CHAPTER 3 RECURSION CHAPTER 4 ANALYSIS OF ALGORITHMS 4.6.1 V IVA PROBLEM 4.6.2 MARRIAGE PROBLEM CHAPTER 5 BASIC DATA STRUCTURES 5.3.1 LINEAR SEARCH 5.4.1 ADVANTAGES OF A LINKED LIST 5.5.1 STATIC IMPLEMENTATION OF STACK 5.6.1 STATIC IMPLEMENTATION CHAPTER 6 TREES CHAPTER 7 GRAPHS CHAPTER 8 SORTING IN LINEAR AND QUADRATIC TIME CHAPTER 9 DIVIDE AND CONQUER CHAPTER 10 GREEDY ALGORITHMS 11.2.1 IMPLEMENTING THE DYNAMIC APPROACH 11.7 THE OPTIMAL BINARY SEARCH TREE PROBLEM CHAPTER 13 BRANCH AND BOUND 13.7.1 OPTIMIZATION 14.6.1 THE BOOK PROBLEM 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 APPENDIX A1 AMORTIZED ANALYSIS REVISITED APPENDIX A2 2-3-4 AND REDBLACK TREES APPENDIX A3 MATRIX OPERATIONS APPENDIX A4 LINEAR PROGRAMMING APPENDIX A5 COMPLEX NUMBERS AND INTRODUCTION TO DFT APPENDIX A6 PROBABILITY APPENDIX A7 SCHEDULING APPENDIX A8 SEARCHING REPRISE APPENDIX A9 ANALYSIS OF SORTING ALGORITHMS APPENDIX A10 PROBLEMS