Beginning algorithms
(eBook)

Book Cover
Average Rating
Contributors
Published
Indianapolis, Ind. : Wiley, 2006.
Format
eBook
ISBN
0470329726, 0471783838, 0764596748, 1280241535, 9780470329726, 9780471783831, 9780764596742, 9781280241536
Physical Desc
1 online resource (xxvi, 564 pages) : illustrations
Status

Description

Loading Description...

Also in this Series

Checking series information...

More Like This

Loading more titles like this title...

Syndetics Unbound

More Details

Language
English

Notes

Bibliography
Includes bibliographical references (page 493) and index.
Restrictions on Access
Use copy,Restrictions unspecified,star,MiAaHDL
Description
"Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-day software development."--Jacket
Reproduction
Electronic reproduction.,[Place of publication not identified] :,HathiTrust Digital Library,,2010.,MiAaHDL
System Details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.,http://purl.oclc.org/DLF/benchrepro0212,MiAaHDL
Action
digitized,2010,HathiTrust Digital Library,committed to preserve,pda,MiAaHDL

Reviews from GoodReads

Loading GoodReads Reviews.

Citations

APA Citation, 7th Edition (style guide)

Harris, S., & Ross, J. (2006). Beginning algorithms . Wiley.

Chicago / Turabian - Author Date Citation, 17th Edition (style guide)

Harris, Simon, 1972- and James Ross. 2006. Beginning Algorithms. Wiley.

Chicago / Turabian - Humanities (Notes and Bibliography) Citation, 17th Edition (style guide)

Harris, Simon, 1972- and James Ross. Beginning Algorithms Wiley, 2006.

MLA Citation, 9th Edition (style guide)

Harris, Simon, and James Ross. Beginning Algorithms Wiley, 2006.

Note! Citations contain only title, author, edition, publisher, and year published. Citations should be used as a guideline and should be double checked for accuracy. Citation formats are based on standards as of August 2021.

Staff View

Grouped Work ID
7daf2fa4-7e67-42ad-37d4-0fc2ad173f2b-eng
Go To Grouped Work

Grouping Information

Grouped Work ID7daf2fa4-7e67-42ad-37d4-0fc2ad173f2b-eng
Full titlebeginning algorithms
Authorharris simon
Grouping Categorybook
Last Update2024-09-06 16:31:08PM
Last Indexed2024-09-21 03:45:31AM

Marc Record

First DetectedJul 29, 2024 03:56:14 PM
Last File Modification TimeSep 06, 2024 04:31:33 PM

MARC Record

LEADER04917cam a2200589 a 4500
001ocm63268680 
003OCoLC
00520240830103855.0
006m     o  d        
007cr cn|||||||||
008060202s2006    inua    ob    001 0 eng d
019 |a 62303899|a 65198477|a 295919319|a 297765423|a 606030808|a 645832986|a 647802770|a 732012383|a 741108101|a 859864312|a 970383923|a 970617322|a 1044244428|a 1056400789|a 1058026026|a 1058190097|a 1060198755|a 1063957340|a 1066494677|a 1073058477|a 1083236818|a 1103278923|a 1104443887|a 1129346991|a 1152984189|a 1179681383|a 1192334651|a 1194737475|a 1240523416|a 1294573324|a 1302285620
020 |a 0470329726|q (electronic bk. ;|q Adobe Reader)
020 |a 0471783838|q (electronic bk. ;|q Adobe Reader)
020 |a 0764596748
020 |a 1280241535
020 |a 9780470329726|q (electronic bk. ;|q Adobe Reader)
020 |a 9780471783831|q (electronic bk. ;|q Adobe Reader)
020 |a 9780764596742
0200 |a 9781280241536|q (online)
035 |a (OCoLC)63268680|z (OCoLC)62303899|z (OCoLC)65198477|z (OCoLC)295919319|z (OCoLC)297765423|z (OCoLC)606030808|z (OCoLC)645832986|z (OCoLC)647802770|z (OCoLC)732012383|z (OCoLC)741108101|z (OCoLC)859864312|z (OCoLC)970383923|z (OCoLC)970617322|z (OCoLC)1044244428|z (OCoLC)1056400789|z (OCoLC)1058026026|z (OCoLC)1058190097|z (OCoLC)1060198755|z (OCoLC)1063957340|z (OCoLC)1066494677|z (OCoLC)1073058477|z (OCoLC)1083236818|z (OCoLC)1103278923|z (OCoLC)1104443887|z (OCoLC)1129346991|z (OCoLC)1152984189|z (OCoLC)1179681383|z (OCoLC)1192334651|z (OCoLC)1194737475|z (OCoLC)1240523416|z (OCoLC)1294573324|z (OCoLC)1302285620
037 |a 97568359-4C89-41A0-B176-1E20AA01EBEA|b OverDrive, Inc.|n http://www.overdrive.com
037 |b OverDrive, Inc.|n http://www.overdrive.com
040 |a TEFOD|b eng|e pn|c TEFOD|d TEFOD|d N$T|d YDXCP|d EBLCP|d OCLCE|d IDEBK|d U5D|d E7B|d OCLCQ|d UMI|d OCLCQ|d B24X7|d OCLCQ|d DEBSZ|d OCLCF|d OCLCQ|d NLE|d OCLCQ|d TEFOD|d OCLCQ|d COO|d OCLCQ|d OCLCO|d OCLCA|d YDX|d OCLCQ|d CEF|d AU@|d WYU|d OCLCQ|d VT2|d BRF|d EYM|d OCLCQ|d OCLCO|d UKAHL|d LVT|d OCLCO|d OCLCQ|d OCLCO|d OCLCL
042 |a dlr
049 |a FMGA
050 4|a QA76.9.A43|b H376 2006eb
08204|a 005.1|2 22
084 |a ST 134|2 rvk
1001 |a Harris, Simon,|d 1972-|1 https://id.oclc.org/worldcat/entity/E39PCjtrbT9XWJxPQkjkrf3rVP|0 http://id.loc.gov/authorities/names/n2005056642
24510|a Beginning algorithms /|c Simon Harris and James Ross.
260 |a Indianapolis, Ind. :|b Wiley,|c 2006.
300 |a 1 online resource (xxvi, 564 pages) :|b illustrations
336 |a text|b txt|2 rdacontent
337 |a computer|b c|2 rdamedia
338 |a online resource|b cr|2 rdacarrier
4901 |a Wrox beginning guides
504 |a Includes bibliographical references (page 493) and index.
5050 |a Getting started -- Iteration and recursion -- String searching -- Lists -- Queues -- Stacks -- Basic sorting -- Advance sorting -- Priority queues -- Binary searching -- Binary search trees -- Red-black trees -- Hashing -- Sets -- Maps -- Computational geometry -- Digital search trees -- B-trees -- Pragmatic optimisation.
506 |3 Use copy|f Restrictions unspecified|2 star|5 MiAaHDL
5201 |a "Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-day software development."--Jacket
533 |a Electronic reproduction.|b [Place of publication not identified] :|c HathiTrust Digital Library,|d 2010.|5 MiAaHDL
538 |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.|u http://purl.oclc.org/DLF/benchrepro0212|5 MiAaHDL
5831 |a digitized|c 2010|h HathiTrust Digital Library|l committed to preserve|2 pda|5 MiAaHDL
5880 |a Print version record.
650 0|a Computer algorithms.|0 http://id.loc.gov/authorities/subjects/sh91000149
650 2|a Algorithms
7001 |a Ross, James,|d 1968-|1 https://id.oclc.org/worldcat/entity/E39PCjHkWYQq8GDGjH8q76DtTd|0 http://id.loc.gov/authorities/names/n2005056643
758 |i has work:|a Beginning algorithms (Text)|1 https://id.oclc.org/worldcat/entity/E39PCGQjkQ67Vbm8Xw47G4ygYX|4 https://id.oclc.org/worldcat/ontology/hasWork
77608|i Print version:|a Harris, Simon, 1972-|t Beginning algorithms.|d Indianapolis, Ind. : Wiley, 2006|z 0764596748|w (DLC) 2005022374|w (OCoLC)61204410
830 0|a Wrox beginning guides.|0 http://id.loc.gov/authorities/names/no2004027240
85640|u https://www.aclib.us/OReilly