<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Introduction to algorithms</title>
  </titleInfo>
  <name type="personal">
    <namePart>Cormen, Thomas H.</namePart>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <genre authority="">Electronic books.</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">mau</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Cambridge, Mass</placeTerm>
    </place>
    <publisher>MIT Press</publisher>
    <dateIssued>�2009</dateIssued>
    <dateIssued encoding="marc">2009</dateIssued>
    <edition>3rd ed.</edition>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="gmd">electronic resource</form>
    <extent>1 online resource (xix, 1292 pages) : illustrations</extent>
  </physicalDescription>
  <tableOfContents>I. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices.</tableOfContents>
  <note type="statement of responsibility">Thomas H. Cormen [and others].</note>
  <note>Includes bibliographical references and index.</note>
  <subject authority="lcsh">
    <topic>Computer programming</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computer algorithms</topic>
  </subject>
  <subject>
    <topic>Computer algorithms</topic>
  </subject>
  <subject>
    <topic>Computer programming</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Programming</topic>
    <topic>Open Source</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Software Development &amp; Engineering</topic>
    <topic>Tools</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Software Development &amp; Engineering</topic>
    <topic>General</topic>
  </subject>
  <subject authority="fast">
    <topic>Computer algorithms</topic>
  </subject>
  <subject authority="fast">
    <topic>Computer programming</topic>
  </subject>
  <subject authority="gtt">
    <topic>Algoritmen</topic>
  </subject>
  <subject authority="gnd">
    <topic>Algorithmentheorie</topic>
  </subject>
  <subject authority="gnd">
    <topic>Algorithmische Programmierung</topic>
  </subject>
  <subject authority="swd">
    <topic>Algorithmische Programmierung</topic>
  </subject>
  <subject authority="swd">
    <topic>Algorithmentheorie</topic>
  </subject>
  <classification authority="lcc">QA76.6 .C662 2009eb</classification>
  <classification authority="ddc" edition="22">005.1</classification>
  <relatedItem type="otherFormat" displayLabel="Print version:">
    <titleInfo>
      <title>Introduction to algorithms</title>
    </titleInfo>
    <originInfo>
      <publisher>Cambridge, Mass. : MIT Press, �2009</publisher>
      <edition>3rd ed.</edition>
    </originInfo>
    <identifier type="local">(DLC)  2009008593</identifier>
    <identifier type="local">(OCoLC)311310321</identifier>
  </relatedItem>
  <identifier type="isbn">9780262270830</identifier>
  <identifier type="isbn">0262270838</identifier>
  <identifier type="isbn">9781628709131</identifier>
  <identifier type="isbn">1628709138</identifier>
  <identifier type="isbn" invalid="yes"/>
  <identifier type="isbn" invalid="yes"/>
  <identifier type="isbn" invalid="yes"/>
  <identifier type="isbn" invalid="yes"/>
  <identifier type="stock number">5A44A5DB-D913-40FF-B59F-2EBD4D1CBD32 OverDrive, Inc.</identifier>
  <identifier type="uri">https://search.ebscohost.com/login.aspx?direct=true&amp;scope=site&amp;db=nlebk&amp;db=nlabk&amp;AN=343613</identifier>
  <location>
    <url displayLabel="EBSCOhost">https://search.ebscohost.com/login.aspx?direct=true&amp;scope=site&amp;db=nlebk&amp;db=nlabk&amp;AN=343613</url>
  </location>
  <recordInfo>
    <recordContentSource authority="marcorg">N$T</recordContentSource>
    <recordCreationDate encoding="marc">101101</recordCreationDate>
    <recordChangeDate encoding="iso8601">20220525094047.0</recordChangeDate>
    <recordIdentifier source="OCoLC">ocn676697295</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
