计算机算法

计算机算法
分享
扫描下方二维码分享到微信
打开微信,点击右上角”+“,
使用”扫一扫“即可将网页分享到朋友圈。
作者: ,
2001-01
版次: 3
ISBN: 9787040100488
定价: 39.50
装帧: 平装
开本: 16开
纸张: 胶版纸
页数: 688页
字数: 1066千字
正文语种: 英语
  • 本书的主要内容包括三部分,一是介绍了如何用算法解决在计算机应用中经常出现的现实问题,二是介绍了计算复杂性的基本原理与技术,最后讲解了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. Preface
    1AnalyzingAlgorithmsandProblems:PrinciplesandExamples
    1.1Introduction
    1.2JavaasanAlgorithmLanguage
    1.3MathematicalBackground
    1.4AnalyzingAlgorithmsandProblems
    1.5ClassifyingFunctionsbyTheirAsymptoticGrowthRates
    1.6SearchinganOrderedArray
    Exercises
    NotesandReferences
    2DataAbstractionandBasicDataStructures
    2.1Introduction
    2.2ADTSpecificationandDesignTechniques
    2.3ElementaryADTs--ListsandTrees
    2.4StacksandQueues
    2.5ADTsforDynamicSets
    Exercises
    NotesandReferences
    3Recursionandinduction
    3.1introduction
    3.2RecursiveProcedures
    3.3WhatisaProof?
    3.4InductionProofs
    3.5ProvingCorrectnessofProcedures
    3.6RecurrenceEquations
    3.7RecursionTrees
    Exercises
    NotesandReferences
    4Sorting
    4.1Introduction
    4.2InsertionSort
    4.3DivideandConquer
    4.4Quicksort
    4.5MergingSortedSequences
    4.6Mergesort
    4.7LowerBoundsforSortingbyComparisonofKeys
    4.8Heapsort
    4.9ComparisonofFourSortingAlgorithms
    4.10Shellsort
    4.11RadixSorting
    Exercises
    Programs
    NotesandReferences
    5SelectionandAdversaryArguments
    5.1Introduction
    5.2Findingmaxandmin
    5.3FindingtheSecond-LargestKey
    5.4TheSelectionProblem
    5.5ALowerBoundforFindingtheMedian
    5.6DesigningAgainstanAdversary
    Exercises
    NotesandReferences
    6DynamicSetsandSearching
    6.1Introduction
    6.2ArrayDoubling
    6.3AmortizedTimeAnalysis
    6.4Red-BlackTrees
    6.5Hashing
    6.6DynamicEquivalenceRelationsandUnion-FindPrograms
    6.7PriorityQueueswithaDecreaseKeyOperation
    Exercises
    Programs
    NotesandReferences
    7GraphsandGraphTraversals
    8GraphOptimizationProblemsandGreedyAlgorithms
    9TransitiveClosure,All-PairsShortestPaths
    10DynamicProgramming
    11StringMatching
    12PolynomialsandMatrices
    13NP-CompleteProblems
    14ParallelAlgorithms
    AJavaExamplesandTechniques
    Bibliography
    Index
  • 内容简介:
    本书的主要内容包括三部分,一是介绍了如何用算法解决在计算机应用中经常出现的现实问题,二是介绍了计算复杂性的基本原理与技术,最后讲解了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.
  • 目录:
    Preface
    1AnalyzingAlgorithmsandProblems:PrinciplesandExamples
    1.1Introduction
    1.2JavaasanAlgorithmLanguage
    1.3MathematicalBackground
    1.4AnalyzingAlgorithmsandProblems
    1.5ClassifyingFunctionsbyTheirAsymptoticGrowthRates
    1.6SearchinganOrderedArray
    Exercises
    NotesandReferences
    2DataAbstractionandBasicDataStructures
    2.1Introduction
    2.2ADTSpecificationandDesignTechniques
    2.3ElementaryADTs--ListsandTrees
    2.4StacksandQueues
    2.5ADTsforDynamicSets
    Exercises
    NotesandReferences
    3Recursionandinduction
    3.1introduction
    3.2RecursiveProcedures
    3.3WhatisaProof?
    3.4InductionProofs
    3.5ProvingCorrectnessofProcedures
    3.6RecurrenceEquations
    3.7RecursionTrees
    Exercises
    NotesandReferences
    4Sorting
    4.1Introduction
    4.2InsertionSort
    4.3DivideandConquer
    4.4Quicksort
    4.5MergingSortedSequences
    4.6Mergesort
    4.7LowerBoundsforSortingbyComparisonofKeys
    4.8Heapsort
    4.9ComparisonofFourSortingAlgorithms
    4.10Shellsort
    4.11RadixSorting
    Exercises
    Programs
    NotesandReferences
    5SelectionandAdversaryArguments
    5.1Introduction
    5.2Findingmaxandmin
    5.3FindingtheSecond-LargestKey
    5.4TheSelectionProblem
    5.5ALowerBoundforFindingtheMedian
    5.6DesigningAgainstanAdversary
    Exercises
    NotesandReferences
    6DynamicSetsandSearching
    6.1Introduction
    6.2ArrayDoubling
    6.3AmortizedTimeAnalysis
    6.4Red-BlackTrees
    6.5Hashing
    6.6DynamicEquivalenceRelationsandUnion-FindPrograms
    6.7PriorityQueueswithaDecreaseKeyOperation
    Exercises
    Programs
    NotesandReferences
    7GraphsandGraphTraversals
    8GraphOptimizationProblemsandGreedyAlgorithms
    9TransitiveClosure,All-PairsShortestPaths
    10DynamicProgramming
    11StringMatching
    12PolynomialsandMatrices
    13NP-CompleteProblems
    14ParallelAlgorithms
    AJavaExamplesandTechniques
    Bibliography
    Index
查看详情
12