Absolute Beginner’s Guide to Algorithms: A Practical Introduction to Data Structures and Algorithms in JavaScript/
by Kirupa Chinnathambi
- xv, 394 pages; illustrations; 24 cm
Includes bibliographic references and index.
Part I: Data Structures Introduction to Data Structures Big O Notation and Complexity Analysis Arrays Linked Lists Stacks Queues Trees Binary Trees Binary Search Trees Heaps Hashtables Tries Graphs Part II: Algorithms Introduction to Recursion Fibonacci and Recursion Techniques Towers of Hanoi Search Algorithms (Linear Search) Binary Search Binary Tree Traversal Depth First Search (DFS) and Breadth First Search (BFS) Quicksort Bubblesort Insertion Sort Selection Sort Mergesort Closing Sections Conclusion Index
With the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. Programming languages come and go, but the core of programming--algorithms and data structures--remains the same. Absolute Beginner's Guide to Algorithms is the fastest way to learn algorithms and data structures. Using helpful diagrams and fully annotated code samples in Javascript, you will start with the basics and gradually go deeper and broader into all the techniques you need to organize your data. Start fast with data structures basics: arrays, stacks, queues, trees, heaps, and more. Walk through popular search, sort, and graph algorithms. Understand Big-O notation and why some algorithms are fast and why others are slow. Balance theory with practice by playing with the fully functional JavaScript implementations of all covered data structures and algorithms" Provided by publisher
9780138222291
Algorithms Data structures JavaScript programming Computational complexity