Tags
Language
Tags
July 2025
Su Mo Tu We Th Fr Sa
29 30 1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31 1 2
    Attention❗ To save your time, in order to download anything on this site, you must be registered 👉 HERE. If you do not have a registration yet, it is better to do it right away. ✌

    ( • )( • ) ( ͡⚆ ͜ʖ ͡⚆ ) (‿ˠ‿)
    SpicyMags.xyz

    Learning JavaScript Data Structures and Algorithms

    Posted By: AlenMiler
    Learning JavaScript Data Structures and Algorithms

    Learning JavaScript Data Structures and Algorithms by Loiane Groner
    English | Oct 27, 2014 | ISBN: 1783554878 | 218 Pages | AZW3/EPUB/MOBI/PDF (conv) | 12 MB

    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.

    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

    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.