Book Image

Learning JavaScript Data Structures and Algorithms - Third Edition

Book Image

Learning JavaScript Data Structures and Algorithms - Third Edition

Overview of this book

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. With this book, you will learn to write complex and powerful code using the latest ES 2017 features. Learning JavaScript Data Structures and Algorithms begins by covering the basics of JavaScript and introduces you to ECMAScript 2017, before gradually moving on to the most important data structures such as arrays, queues, stacks, and linked lists. You will gain in-depth knowledge of how hash tables and set data structures function as well as how trees and hash maps can be used to search files in an HD or represent a database. This book serves as a route to take you deeper into JavaScript. You’ll also get a greater understanding of why and how graphs, one of the most complex data structures, are largely used in GPS navigation systems in social networks. Toward the end of the book, you’ll discover how all the theories presented in this book can be applied to solve real-world problems while working on your own computer networks and Facebook searches.
Table of Contents (22 chapters)
Title Page
Dedication
Packt Upsell
Contributors
Preface
Index

Chapter 14. Algorithm Designs and Techniques

So far, we have had fun discussing how to implement several different data structures and the most commonly used sorting and searching algorithms. An algorithm in the programming world is very interesting. The most beautiful thing about algorithms (and programming logic) is that there is more than one approach to resolving a problem. As we learned in previous chapters, we can design a solution using the iterative approach or make the code easier to read using recursion. There are also other techniques we can use to solve problems with algorithms. In this chapter, we will learn about different techniques, and we will also discuss the next steps in case you are interested in diving deeper into this world.

In this chapter, we will cover:

  • Divide and conquer algorithms
  • Dynamic programming
  • Greedy algorithms
  • Backtracking algorithms
  • Famous algorithm problems