<?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>00977nam a22002414a 4500</leader>
  <controlfield tag="001">PE-BaUNAB</controlfield>
  <controlfield tag="005">20260623165349.0</controlfield>
  <controlfield tag="006">a||||gr|||| 001 0 </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">      t        pe     gr     00| 0 spa d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9780262518802</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">PE-BaUNAB</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">spa</subfield>
  </datafield>
  <datafield tag="043" ind1=" " ind2=" ">
    <subfield code="c">per</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">005.1</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Cormen, Thomas H</subfield>
    <subfield code="e">Autor</subfield>
    <subfield code="9">12502</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Algorithms unlocked</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Cambridge, </subfield>
    <subfield code="b">Massachusetts : The MIT Press, </subfield>
    <subfield code="c">2013.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">222 pages : </subfield>
    <subfield code="c">23 cm.</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a">Preface -- What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems -- Bibliography -- Index.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer algorithms</subfield>
    <subfield code="9">13729</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="c">LIB</subfield>
    <subfield code="e">2026-06-23</subfield>
    <subfield code="z">LRM</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="8">SIS </subfield>
    <subfield code="a">B01</subfield>
    <subfield code="b">B01</subfield>
    <subfield code="d">2026-06-23</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.1 C813</subfield>
    <subfield code="p">01L000008281</subfield>
    <subfield code="r">2026-06-23 16:54:34</subfield>
    <subfield code="y">LIB</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="8">SIS </subfield>
    <subfield code="a">B01</subfield>
    <subfield code="b">B01</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.1 C813</subfield>
    <subfield code="p">01L000008282</subfield>
    <subfield code="r">2026-06-23 16:54:34</subfield>
    <subfield code="t">ej.2</subfield>
    <subfield code="y">LIB</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="8">SIS </subfield>
    <subfield code="a">B01</subfield>
    <subfield code="b">B01</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.1 C813</subfield>
    <subfield code="p">01L000008283</subfield>
    <subfield code="r">2026-06-23 16:54:34</subfield>
    <subfield code="t">ej.3</subfield>
    <subfield code="y">LIB</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">6070</subfield>
    <subfield code="d">6070</subfield>
  </datafield>
</record>
