<?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>How to think about algorithms</title>
  </titleInfo>
  <name type="personal">
    <namePart>Edmonds, Jeff</namePart>
    <namePart type="date">1963-</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">nyu</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Cambridge, United Kingdom</placeTerm>
    </place>
    <place>
      <placeTerm type="text">New York, NY</placeTerm>
    </place>
    <publisher>Cambridge University Press</publisher>
    <dateIssued>2024</dateIssued>
    <dateIssued encoding="marc">2023</dateIssued>
    <edition>2nd.</edition>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xv, 599 24 cm.</extent>
  </physicalDescription>
  <abstract>"The second edition of this student-friendly textbook now includes over 150 new exercises, key concept summaries and a chapter on machine learning algorithms. Its approachability and clarity make it ideal as both a main course text or as a supplementary book for students who find other books challenging"--</abstract>
  <note type="statement of responsibility">by Jeff Edmonds.</note>
  <note>Includes bibliographical references and index.</note>
  <subject authority="lcsh">
    <topic>Algorithms</topic>
    <topic>Study and teaching</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Loops (Group theory)</topic>
    <topic>Study and teaching</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Invariants</topic>
    <topic>Study and teaching</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Recursion theory</topic>
    <topic>Study and teaching</topic>
  </subject>
  <classification authority="ddc" edition="23">518.1 EDM.J</classification>
  <relatedItem type="otherFormat" displayLabel="Online version:">
    <titleInfo>
      <title>How to think about algorithms</title>
    </titleInfo>
    <name>
      <namePart>EDMONDS, JEFF.</namePart>
    </name>
    <originInfo>
      <publisher>New York : Cambridge University Press, 2023</publisher>
      <edition>2.</edition>
    </originInfo>
    <identifier type="local">(DLC) 2023011131</identifier>
  </relatedItem>
  <identifier type="isbn">9781009302135 (pbk.)</identifier>
  <identifier type="lccn">2023011130</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">DLC</recordContentSource>
    <recordCreationDate encoding="marc">230501</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260425114930.0</recordChangeDate>
    <recordIdentifier source="OSt">23099548</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
