Learn Data Structure and Algorithms by JavaScript

You need to have basic understanding of the JavaScript programming language to proceed with the codes from this repository.

Table of Contents

• Introduction to JavaScript

• Data Structure

  • Linked List
  • Stack
  • Queue
  • Binary Search Tree (BST)
  • Heap
  • Hash Table
  • Disjoint Set Union (Union Find)
  • Trie
  • Suffix Array
  • Segment Tree
  • Binary Indexed Tree (BIT)
  • Heavy Light Decomposition

• Searching

  • Linear Search
  • Binary Search
  • Ternary Search

• Sorting

  • Selection Sort
  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Bucket Sort
  • Counting Sort
  • Heap Sort
  • Radix Sort

• Graph Algorithms

  • Graph Representation
  • Breadth First Search (BFS)
  • Depth First Search (DFS)
  • Topological Sort
  • Strongly Connected Components (SCC)
  • Minimum Spanning Tree (MST)
  • All Pairs Shortest Path (Floyd Warshall's Algorithm)
  • Single Source Shortest Path Algorithm
    • Djkastra's Algorithm
    • Bellman Ford Algorithm
  • Directed Acyclic Graph
  • Bipartite Matching
  • Articulation Point, Bridge
  • Euler Tour/Path
  • Hamiltonian Cycle
  • Stable Marriage Problem
  • Chinese Postman Problem
  • 2-satisfiability
  • Flow Algorithms
    • Maximum Flow
    • Minimum Cut
    • Min-Cost Max Flow
    • Maximum Bipartite Matching
    • Vertex Cover

• Dynamic Programming

  • Rod Cutting
  • Maximum Sum (1D, 2D)
  • Coin Change
  • Longest Common Subsequence
  • Longest Increasing Subsequence
  • Matrix Multiplication
  • Edit Distance (Levenshtein distance)
  • 0/1 Knapsack
  • Travelling Salesman Problem
  • Optimal Binary Search Tree

• Greedy Algorithms

  • Activity Selection/Task Scheduling
  • Huffman Coding
  • Knapsack Problem (Fractional Knapsack)

• String Algorithms

  • Rabin-Karp Algorithm
  • Knuth-Morris-Pratt Algorithm
  • Z Algorithm
  • Aho-Korasick Algorithm
  • Manachers Algorithm
  • Boyr-Moore Algorithm

• Number Theory

  • Greatest Common Divisor (GCD)
  • Longest Common Multiplier (LCM)
  • Euler Totient (Phi)
  • Prime finding(Sieve of Eratosthenes)
  • Prime factorization
  • Factorial
  • Fibonacci
  • Counting, Permutation, combination
  • Exponentiation
  • Big Mod
  • Euclid, Extended euclid
  • Josephus Problem
  • Farey Sequence
  • Catalan numbers
  • Burnside's lemma/circular permutation
  • Modular inverse
  • Probability
  • Chinese Remainder Theorem
  • Gaussian Elmination method
  • Dilworth's Theorem
  • Matrix Exponentiation

• Computational Geometry

  • Pick's Theorem
  • Convex hull
  • Line Intersection
  • Point in a polygon
  • Area of a polygon
  • Line Sweeping
  • Polygon intersection
  • Closest Pair

• Game Theory

  • Take Away Game
  • Nim's Game
  • Sprague-grundy Number

• Others

  • BackTracking
    • N-Queen's Problem

---

Introduction

JavaScript is a loosely typed or a dynamic language. That means you don't have to declare the type of a variable ahead of time. The type will get determined automatically while the program is being processed. That also means that you can have the same variable as different types:

var foo = 42;    // foo is now a Number
var foo = 'bar'; // foo is now a String
var foo = true;  // foo is now a Boolean

Data Types in JavaScript

The latest ECMAScript standard defines seven data types:

• Six data types that are primitives:

  • Boolean (true and false)
  • Null (invalid object or address has the value null)
  • Undefined (a variable that has not been assigned a value has the value undefined)
  • Number (integer and floating point values ranging from -(2⁵³ -1) to (2⁵³ -1), +Infinity, -Infinity and NaN(not-a-number) )
  • String (Sequence of textual characters. Strings are immutable in JavaScript)
  • Symbol (new in ECMAScript 6)

• Object

Arrays

JavaScript Arrays are regular objects for which there is a particular relationship between integer-key-ed properties and the 'length' property. Additionally, arrays inherit from Array.prototype which provides to them a handful of convenient methods to manipulate arrays like indexOf (searching a value in the array) or push (adding an element to the array), etc. This makes arrays a perfect candidate to represent lists or sets.

More details about data types in JavaScript:

• JavaScript data types and data structures - Mozilla Developer Network
• A Beginner’s Guide to JavaScript Variables and Datatypes - SitePoint

Object Oriented Programming in JavaScript

• Introduction to Object-Oriented JavaScript - Mozilla Developer Network
• OOP In JavaScript: What You NEED to Know - JavaScript is sexy

Big-O Notation and Time Complexity Analysis

Algorithms in plain English: time complexity and Big-O notation

Big-O Cheat Sheet Link

How to Use

The easiest way to run and test the codes from this repository is to use nodejs (I have checked my code using nodejs v6.5.0 in an Windows machine).

Install it in your machine and add it to your environment path so that it is accessible in terminal commands.

Then you can run a JavaScript file like this:

node file.js

Useful Links:

• Eloquent JavaScript
• Speaking JS
• You-Dont-Know-JS
• JavaScript - Mozilla Developer Network
• Algorithms, 4th Edition (book by: Robert Sedgewick and Kevin Wayne)