Algorithms: Design and Analysis
Algorithms: Design and Analysis
复制标题
算法：设计与分析
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Harsh Bhasin
中科院分区：
文献类型：
--
作者：
Harsh Bhasin
第1章算法简介第2章函数增长第3章递归第4章算法分析4.6.1 V IVA问题4.6.2婚姻问题第5章基本数据结构5.3.1线性搜索5.4.1链表的优点5.5.1堆栈的静态实现5.6.1静态实现第6章树第7章第8章线性和二次时间排序第9章第10章贪婪算法11.2.1实现动态方法11.7最优二叉搜索树问题第13章分枝定界13.7.1优化14.6.1《问题》一书第17章数论算法第18章字符串匹配第19章复杂性分类第20章PSPACE简介第21章近似算法第22章并行算法第23章机器学习方法简介第24章计算生物学和生物信息学附录A1摊销分析重读附录A2 2-3-4和RedBlack Trees附录A3矩阵运算附录A4线性规划附录A5复数和DFT简介附录A6概率附录A7调度附录A8搜索重复附录A9排序算法分析附录A10问题
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