JavaScript 中的数据结构与算法-(影印版)

本书特色

[

javascript程序员因而迫切需要使用传统语言(比如c 和java)提供的工具，包括传统的数据结构以及传统的排序和查找算法。《数据结构与算法javascript描述》讨论在数组即对象、无处不在的全局变量、基于原型的对象模型等javascript语言的环境下，如何实现高效的数据结构和算法。

]

目录

preface1. the javascript programming environment and modelthe javascript environmentjavascript programming practicesdeclaring and initializing variablesarithmetic and math library functions in javascriptdecision constructsrepetition constructsfunctionsvariable scoperecursionobjects and object-oriented programmingsummary2. arraysjavascript arrays definedusing arrayscreating arraysaccessing and writing array elementscreating arrays from stringsaggregate array operationsaccessor functionssearching for a valuestring representations of arrayscreating new arrays from existing arraysmutator functionsadding elements to an arrayremoving elements from an arrayadding and removing elements from the middle of an arrayputting array elements in orderiterator functionsnon-array-generating iterator functionsiterator functions that return a new arraytwo-dimensional and multidimensional arrayscreating two-dimensional arraysprocessing two-dimensional array elementsjagged arraysarrays of objectsarrays in objectsexercises3. listsa list adta list class implementationappend: adding an element to a listremove: removing an element from a listfind: finding an element in a listlength: determining the number of elements in a listtostring: retrieving a list’s elementsinsert: inserting an element into a listclear: removing all elements from a listcontains: determining if a given value is in a listmoving to and retrieving a list elementiterating through a listiterating through a lista list-based applicationreading text filesusing lists to manage a kioskexercises4. stacksstack operationsa stack implementationusing the stack classmultiple base conversionspalindromesdemonstrating recursionexercises5. queuesqueue operationsan array-based queue class implementationusing the queue class: assigning partners at a square dancesorting data with queuespriority queuesexercises6. linked listsshortcomings of arrayslinked lists definedan object-based linked list designthe node classthe linked list classinserting new nodesremoving nodes from a linked listdoubly linked listscircularly linked listsother linked list functionsexercises7. dictionariesthe dictionary classauxiliary functions for the dictionary classadding sorting to the dictionary classexercises8. hashingan overview of hashinga hash table classchoosing a hash functiona better hash functionhashing integer keysstoring and retrieving data in a hash tablehandling collisionsseparate chaininglinear probingexercises9. setsfundamental set definitions, operations, and propertiesset definitionsset operationsthe set class implementationmore set operationsexercises10. binary trees and binary search treestrees definedbinary trees and binary search treesbuilding a binary search tree implementationtraversing a binary search treebst searchessearching for the minimum and maximum valuesearching for a specific valueremoving nodes from a bstcounting occurrencesexercises11. graphs and graph algorithmsgraph definitionsreal-world systems modeled by graphsthe graph classrepresenting edgesbuilding a graphsearching a graphdepth-first searchbreadth-first searchfinding the shortest pathbreadth-first search leads to shortest pathsdetermining pathstopological sortingan algorithm for topological sortingimplementing the topological sorting algorithmexercises12. sorting algorithmsan array test bedgenerating random databasic sorting algorithmsbubble sortselection sortinsertion sorttiming comparisons of the basic sorting algorithmsadvanced sorting algorithmsthe shellsort algorithmthe mergesort algorithmthe quicksort algorithmexercises13. searching algorithmscommonly used functions in examplessearching for minimum and maximum valuesusing self-organizing databinary searchcounting occurrencessearching textual dataexercises14. advanced algorithmsdynamic programminga dynamic programming example: computing fibonacci numbersfinding the longest common substringthe knapsack problem: a recursive solutionthe knapsack problem: a dynamic programming solutiongreedy algorithmsa first greedy algorithm example: the coin-changing problema greedy algorithm solution to the knapsack problemexercisesindex

封面

书名:JavaScript 中的数据结构与算法-(影印版)

作者:麦克米兰

页数:231

定价:¥48.0

出版社:东南大学出版社

出版日期:2015-02-01

ISBN:9787564153458

PDF电子书大小:80MB 高清扫描完整版