Learning JavaScript Data Structures and Algorithms (Paperback)

Understand and implement classic data structures and algorithms using JavaScript

About This Book

• Learn how to use the most used data structures such as array, stack, list, tree, and graphs with real-world examples
• Get a grasp on which one is best between searching and sorting algorithms and learn how to implement them
• Follow through solutions for notable programming problems with step-by-step explanations

Who This Book Is For

If you are a JavaScript developer or someone who has basic knowledge of JavaScript, and want to explore its optimum ability, this fast-paced book is definitely for you. Programming logic is the only thing you need to know to start having fun with algorithms.

In Detail

A data structure is a particular way of organizing data in a computer to utilize resources efficiently. Data structures and algorithms are the base of every solution to any programming problem.

This book begins by covering the basics of the JavaScript language and then moves on to discuss the most important data structures such as array, queue, stack, and linked list. You will also gain an in-depth knowledge of how hash tables and set data structure function. After this, you will be taught what trees are, and how to use the binary tree and the binary search tree.

In subsequent chapters, you will learn about graphs, DFS, and BFS. Finally, we will round off by learning how to differentiate between various searching and sorting algorithms such as sequential search, binary search, quick sort, bubble sort, and so on, and how to implement them. Towards the end of the book, you will also be introduced to dynamic programming.

了解並使用JavaScript實現經典的數據結構和算法

關於本書
- 通過實際示例學習如何使用最常用的數據結構，如數組、堆棧、列表、樹和圖形
- 瞭解搜索和排序算法之間的最佳選擇，並學習如何實現它們
- 逐步解釋重要的編程問題的解決方案

本書適合對JavaScript有基本知識的JavaScript開發人員或其他人，並希望探索其最佳能力的讀者。只需要了解編程邏輯，就可以開始享受算法的樂趣。

詳細內容
數據結構是一種特定的方式，用於在計算機中高效利用資源。數據結構和算法是解決任何編程問題的基礎。

本書首先介紹了JavaScript語言的基礎知識，然後討論了最重要的數據結構，如數組、隊列、堆棧和鏈表。您還將深入了解哈希表和集合數據結構的運作方式。之後，您將學習樹和如何使用二叉樹和二叉搜索樹。

在接下來的章節中，您將學習圖形、深度優先搜索和廣度優先搜索。最後，我們將學習如何區分各種搜索和排序算法，如順序搜索、二分搜索、快速排序、冒泡排序等，以及如何實現它們。在本書的最後，您還將介紹動態編程。