<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>02303nam a2200301Ia 4500</leader>
  <controlfield tag="005">20260803094148.0</controlfield>
  <controlfield tag="008">251212s2013    xx            000 0 und dopyright opyright opyright </controlfield>
  <datafield tag="245" ind1="1" ind2=" ">
    <subfield code="a">Algorithms Unlocked /</subfield>
    <subfield code="c">Thomas H. Cormen.</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Cormen, Thomas H.,|eauthor</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Cambridge, Massachusetts :</subfield>
    <subfield code="b">MIT Press,</subfield>
    <subfield code="c">copyright 2013.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xiii, 222 pages : illustrations ; 23 cm.:</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references (pages 213-214) and index.</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">978-0-262-51880-2</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer algorithms.</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2=" ">
    <subfield code="a">005.1 C81 c2013</subfield>
  </datafield>
  <datafield tag="943" ind1=" " ind2=" ">
    <subfield code="b">0</subfield>
    <subfield code="c">0</subfield>
    <subfield code="d">0</subfield>
    <subfield code="e">1</subfield>
    <subfield code="f">0</subfield>
    <subfield code="g">0</subfield>
    <subfield code="h">0</subfield>
    <subfield code="i">0</subfield>
    <subfield code="j">0</subfield>
  </datafield>
  <datafield tag="944" ind1=" " ind2=" ">
    <subfield code="b">1</subfield>
    <subfield code="c">1</subfield>
    <subfield code="d">0</subfield>
  </datafield>
  <datafield tag="953" ind1=" " ind2=" ">
    <subfield code="p">HED5427</subfield>
  </datafield>
  <datafield tag="546" ind1=" " ind2=" ">
    <subfield code="a">in English</subfield>
  </datafield>
  <datafield tag="953" ind1=" " ind2=" ">
    <subfield code="c">CollLib</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a">"Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen--coauthor of the leading college textbook on the subject--provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; the fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time."--Back cover.</subfield>
  </datafield>
  <datafield tag="591" ind1=" " ind2=" ">
    <subfield code="a">0</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text|2rdacontent.</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">unmediated|2rdamedia.</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">volume|2rdacarrier.</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">BK</subfield>
    <subfield code="a">hpayson</subfield>
    <subfield code="b">2015-05-22 16:35:11</subfield>
    <subfield code="d">hpayson</subfield>
    <subfield code="e">2015-05-22 16:35:11</subfield>
  </datafield>
  <datafield tag="998" ind1=" " ind2=" ">
    <subfield code="a">8289</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">8263</subfield>
    <subfield code="d">8263</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">HED</subfield>
    <subfield code="b">HED</subfield>
    <subfield code="c">HED</subfield>
    <subfield code="d">2025-12-21</subfield>
    <subfield code="o">005.1 C81 c2013</subfield>
    <subfield code="p">HED5427</subfield>
    <subfield code="r">2026-06-02 00:00:00</subfield>
    <subfield code="w">2025-12-21</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
