跳到内容
Introduction to algorithms 预览资料
关闭预览资料
正在查...

Introduction to algorithms

著者: Thomas H Cormen
出版商: Cambridge, Mass. : MIT Press, ©2001.
版本/格式:   Print book : 英语 : 2nd ed查看所有的版本和格式
数据库:WorldCat
提要:
The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or  再读一些...
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

类型/形式: Einführung
文件类型:
所有的著者/提供者: Thomas H Cormen
ISBN: 0262032937 9780262032933 0070131511 9780070131514 0262531968 9780262531962
OCLC号码: 46792720
注意: Revised edition of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
描述: xxi, 1180 pages ; 24 cm
内容: The role of algorithms in computing --
Getting started --
Growth of functions --
Recurrences --
Probabilistic analysis and randomized algortihms --
Heapsort --
Quicksort --
Sorting in linear time --
Medians and order statistics --
Elementary data structures --
Hash Tables --
Binary Search trees --
Red-black trees --
Augmenting data structures --
Dynamic programming --
Greedy Algorithms --
Amortized analysis --
B-trees --
Binomial heaps --
Fibonacci heaps --
Data structures for disjoint sets --
Elementary graph algorithms --
Minimum spanning trees --
Single-source shortest paths --
All-pairs shortest paths --
Maximum flow --
Sorting networks --
Matrix operations--
Linear programming --
Polynomials and the FFT --
Number-theoretic algortihsm --
String matching--
Computational geometry --
NP-completeness --
approximation algorithms --
A. summations --
B. Sets, etc. --
C. Counting and probability.
其他题名: Algorithms
责任: Thomas H. Cormen [and others].

摘要:

The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

评论

用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

所有的用户标签 (5)

查看最热门的标签,展示的形式是: 标签列表 | 标签云(tag cloud)

相似资料

相关主题:(9)

这资料的用户列表 (10)

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


Primary Entity

<http://www.worldcat.org/oclc/46792720> # Introduction to algorithms
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "46792720" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/6419620#Place/cambridge_mass> ; # Cambridge, Mass.
   rdfs:seeAlso <http://experiment.worldcat.org/entity/work/data/6419620#CreativeWork/introduction_to_algorithms> ; # Introduction to algorithms.
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmentheorie> ; # Algorithmentheorie
   schema:about <http://id.worldcat.org/fast/872390> ; # Computer programming
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithms> ; # Algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/informatik> ; # Informatik
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmes> ; # Algorithmes
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmus> ; # Algorithmus
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/programmation_informatique> ; # Programmation (Informatique)
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/theoretische_informatik> ; # Theoretische Informatik
   schema:about <http://dewey.info/class/005.1/e21/> ;
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:alternateName "Algorithms" ;
   schema:bookEdition "2nd ed." ;
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/6419620#Person/cormen_thomas_h> ; # Thomas H. Cormen
   schema:copyrightYear "2001" ;
   schema:datePublished "2001" ;
   schema:description "The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algortihms -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash Tables -- Binary Search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy Algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algortihsm -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/6419620> ;
   schema:genre "Einführung"@en ;
   schema:inLanguage "en" ;
   schema:name "Introduction to algorithms"@en ;
   schema:productID "46792720" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/46792720#PublicationEvent/cambridge_mass_mit_press_2001> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/6419620#Agent/mit_press> ; # MIT Press
   schema:workExample <http://worldcat.org/isbn/9780262531962> ;
   schema:workExample <http://worldcat.org/isbn/9780262032933> ;
   schema:workExample <http://worldcat.org/isbn/9780070131514> ;
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA152709> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/46792720> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/6419620#Person/cormen_thomas_h> # Thomas H. Cormen
    a schema:Person ;
   schema:familyName "Cormen" ;
   schema:givenName "Thomas H." ;
   schema:name "Thomas H. Cormen" ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Place/cambridge_mass> # Cambridge, Mass.
    a schema:Place ;
   schema:name "Cambridge, Mass." ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmentheorie> # Algorithmentheorie
    a schema:Intangible ;
   schema:name "Algorithmentheorie"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/programmation_informatique> # Programmation (Informatique)
    a schema:Intangible ;
   schema:name "Programmation (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/theoretische_informatik> # Theoretische Informatik
    a schema:Intangible ;
   schema:name "Theoretische Informatik"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/872390> # Computer programming
    a schema:Intangible ;
   schema:name "Computer programming"@en ;
    .

<http://worldcat.org/isbn/9780070131514>
    a schema:ProductModel ;
   schema:isbn "0070131511" ;
   schema:isbn "9780070131514" ;
    .

<http://worldcat.org/isbn/9780262032933>
    a schema:ProductModel ;
   schema:isbn "0262032937" ;
   schema:isbn "9780262032933" ;
    .

<http://worldcat.org/isbn/9780262531962>
    a schema:ProductModel ;
   schema:isbn "0262531968" ;
   schema:isbn "9780262531962" ;
    .


Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.