成功加入购物车
图书条目标准图
正版品相完好,套书和多封面版本咨询客服后再下单
Baase、Gelder 著 / 高等教育出版社 / 2001-01 / 平装
售价 ¥ 21.11 5.3折
定价 ¥39.50
品相 九品
优惠 满包邮
延迟发货说明
上书时间2024-05-10
卖家超过10天未登录
计算机算法
本书的主要内容包括三部分,一是介绍了如何用算法解决在计算机应用中经常出现的现实问题,二是介绍了计算复杂性的基本原理与技术,最后讲解了NP-完备性问题及并行算法。本书强调算法设计技术,对每一个问题,首先讨论多个解决方法,然后设计、分析、修改或放弃某一算法,通过不断的深入研究,直到最后得到满意的结果。因此本书作者希望读者阅读此书,逐步培养形成一种新的分析问题的思维方式。
本书在第二版的基础上,增加了三章新内容以及许多新的主题,同时对原有章节也做了重新调整。本版次还新增了100多道习题和Java实例,书中的所有程序均以Java伪码形式给出。
内容:1.算法分析原理2.数据抽象与基本数据结构3.递归与归纳4.分类5.选择6.动态集合与查找7.图与图的遍历8.图的优化问题与贪心算法9.传递闭包10.动态编程11.字符串匹配12.多项式与矩阵13.NP-完备性问题14.并行算法附录Java实例与技术
SaraBaaseisprofessorofcomputerScienceatSanDiegoUniversityandhasbeenteachingCSfor25years.Dr.Baaseisathree-timerecipientoftheSanStateUniversityAlumniAssociationsOutsatandingFacultyAward,adnshehaswrittenanumberoftextbooksintheareasofalgorithms,assemblylanguage,andsocialandethicalissuesrelatetocomputing.SheearnedherdoctorateattheUniversityofCalifornia,Berkeley.
AllenVanCelderisprofessorofcomputerScienceattheUniversityofCaliforniaatSantaCruz,wherehehasbeenteachingCSfor12years.HereceivedhisPh.D.inComputerScienceatStanfordUniversityandisapastrecipientofthePresidentialYoungInvestigatorAward.
Preface1AnalyzingAlgorithmsandProblems:PrinciplesandExamples1.1Introduction1.2JavaasanAlgorithmLanguage1.3MathematicalBackground1.4AnalyzingAlgorithmsandProblems1.5ClassifyingFunctionsbyTheirAsymptoticGrowthRates1.6SearchinganOrderedArrayExercisesNotesandReferences2DataAbstractionandBasicDataStructures2.1Introduction2.2ADTSpecificationandDesignTechniques2.3ElementaryADTs--ListsandTrees2.4StacksandQueues2.5ADTsforDynamicSetsExercisesNotesandReferences3Recursionandinduction3.1introduction3.2RecursiveProcedures3.3WhatisaProof?3.4InductionProofs3.5ProvingCorrectnessofProcedures3.6RecurrenceEquations3.7RecursionTreesExercisesNotesandReferences4Sorting4.1Introduction4.2InsertionSort4.3DivideandConquer4.4Quicksort4.5MergingSortedSequences4.6Mergesort4.7LowerBoundsforSortingbyComparisonofKeys4.8Heapsort4.9ComparisonofFourSortingAlgorithms4.10Shellsort4.11RadixSortingExercisesProgramsNotesandReferences5SelectionandAdversaryArguments5.1Introduction5.2Findingmaxandmin5.3FindingtheSecond-LargestKey5.4TheSelectionProblem5.5ALowerBoundforFindingtheMedian5.6DesigningAgainstanAdversaryExercisesNotesandReferences6DynamicSetsandSearching6.1Introduction6.2ArrayDoubling6.3AmortizedTimeAnalysis6.4Red-BlackTrees6.5Hashing6.6DynamicEquivalenceRelationsandUnion-FindPrograms6.7PriorityQueueswithaDecreaseKeyOperationExercisesProgramsNotesandReferences7GraphsandGraphTraversals8GraphOptimizationProblemsandGreedyAlgorithms9TransitiveClosure,All-PairsShortestPaths10DynamicProgramming11StringMatching12PolynomialsandMatrices13NP-CompleteProblems14ParallelAlgorithmsAJavaExamplesandTechniquesBibliographyIndex
展开全部
配送说明
...
相似商品
为你推荐
开播时间:09月02日 10:30