|
|
|
|
LEADER |
00000cam a2200000Ia 4500 |
001 |
OR_ocn876268837 |
003 |
OCoLC |
005 |
20231017213018.0 |
006 |
m o d |
007 |
cr unu|||||||| |
008 |
140410s2014 caua o 001 0 eng d |
040 |
|
|
|a UMI
|b eng
|e pn
|c UMI
|d COO
|d CUS
|d DEBBG
|d DEBSZ
|d REB
|d OCLCQ
|d OCLCF
|d OCLCQ
|d CEF
|d UAB
|d AU@
|d OCLCO
|d OCLCQ
|d OCLCO
|
020 |
|
|
|a 1449364934
|
020 |
|
|
|a 9781449364939
|
020 |
|
|
|z 9781449364939
|
029 |
1 |
|
|a DEBBG
|b BV042032061
|
029 |
1 |
|
|a DEBSZ
|b 41417528X
|
029 |
1 |
|
|a GBVCP
|b 796786283
|
035 |
|
|
|a (OCoLC)876268837
|
037 |
|
|
|a CL0500000409
|b Safari Books Online
|
050 |
|
4 |
|a QA76.9.D35
|b M36 2014
|
082 |
0 |
4 |
|a 005.73
|2 23
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a McMillan, Michael,
|d 1957-
|
245 |
1 |
0 |
|a Data structures and algorithms with JavaScript /
|c Michael McMillan.
|
260 |
|
|
|a Sebastopol, CA :
|b O'Reilly,
|c ©2014.
|
300 |
|
|
|a 1 online resource (1 volume) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
588 |
0 |
|
|a Online resource; title from title page (Safari, viewed Mar. 24, 2014).
|
500 |
|
|
|a Includes index.
|
520 |
8 |
|
|a Annotation
|b As an experienced JavaScript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like C♯ and Java. This practical guide shows you how to work hands-on with a variety of storage mechanismsincluding linked lists, stacks, queues, and graphswithin the constraints of the JavaScript environment. Determine which data structures and algorithms are most appropriate for the problems youre trying to solve, and understand the tradeoffs when using them in a JavaScript program. An overview of the JavaScript features used throughout the book is also included. This book covers:Arrays and lists: the most common data structuresStacks and queues: more complex list-like data structuresLinked lists: how they overcome the shortcomings of arraysDictionaries: storing data as key-value pairsHashing: good for quick insertion and retrievalSets: useful for storing unique elements that appear only onceBinary Trees: storing data in a hierarchical mannerGraphs and graph algorithms: ideal for modeling networksAlgorithms: including those that help you sort or search dataAdvanced algorithms: dynamic programming and greedy algorithms.
|
590 |
|
|
|a O'Reilly
|b O'Reilly Online Learning: Academic/Public Library Edition
|
650 |
|
0 |
|a Data structures (Computer science)
|
650 |
|
0 |
|a Object-oriented programming (Computer science)
|
650 |
|
0 |
|a JavaScript (Computer program language)
|
650 |
|
6 |
|a Structures de données (Informatique)
|
650 |
|
6 |
|a Programmation orientée objet (Informatique)
|
650 |
|
6 |
|a JavaScript (Langage de programmation)
|
650 |
|
7 |
|a Data structures (Computer science)
|2 fast
|
650 |
|
7 |
|a JavaScript (Computer program language)
|2 fast
|
650 |
|
7 |
|a Object-oriented programming (Computer science)
|2 fast
|
856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781449373931/?ar
|z Texto completo (Requiere registro previo con correo institucional)
|
994 |
|
|
|a 92
|b IZTAP
|