<?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>01343    a2200229   4500</leader>
  <controlfield tag="003">OSt</controlfield>
  <controlfield tag="005">20251208152144.0</controlfield>
  <controlfield tag="008">251208b        |||||||| |||| 00| 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9784842005519</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Hetland M.</subfield>
    <subfield code="9">215700</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Python Algorithms</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">2nd Ed.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="b">Apress</subfield>
    <subfield code="c">2014</subfield>
    <subfield code="a">New York</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">295pp</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Python Algorithms, Second Edition explains the Python approach to algorithm analysis and design. Written by Magnus Lie Hetland, author of Beginning Python, this book is sharply focused on classical algorithms, but it also gives a solid understanding of fundamental algorithmic problem-solving techniques.

The book deals with some of the most important and challenging areas of programming and computer science in a highly readable manner. It covers both algorithmic theory and programming practice, demonstrating how theory is reflected in real Python programs. Well-known algorithms and data structures that are built into the Python language are explained, and the user is shown how to implement and evaluate others.</subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="1">
    <subfield code="a">What&#x2019;s All This, Then</subfield>
    <subfield code="9">215742</subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="2">
    <subfield code="a">Some Core Ideas in Computing</subfield>
    <subfield code="9">215743</subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="3">
    <subfield code="a">The Skinny on Sums</subfield>
    <subfield code="9">215744</subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="4">
    <subfield code="a">Finding a Maximum Permutation</subfield>
    <subfield code="9">215745</subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="5">
    <subfield code="a">Topological Sorting</subfield>
    <subfield code="9">215746</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">BK</subfield>
    <subfield code="2">ddc</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">369319</subfield>
    <subfield code="d">369319</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="8">MCA</subfield>
    <subfield code="a">001</subfield>
    <subfield code="b">001</subfield>
    <subfield code="d">2025-12-06</subfield>
    <subfield code="e">8</subfield>
    <subfield code="g">7979.25</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">KBJP-BK-2884</subfield>
    <subfield code="r">2025-12-06 00:00:00</subfield>
    <subfield code="v">10639.00</subfield>
    <subfield code="w">2025-12-06</subfield>
    <subfield code="y">BK</subfield>
    <subfield code="z">2884</subfield>
  </datafield>
</record>
