This app contains JavaScript based examples of many popular algorithms and data structures.
☝ Note that this project is meant to be used for learning and researching purposes only and it is not meant to be used for production.
Table of Content
Linked List Doubly Linked List Queue Stack Hash Table Heap Priority Queue Trie Tree Binary Search Tree AVL Tree Red-Black Tree Segment Tree Fenwick Tree Graph Disjoint Set Bloom Filter Bit Manipulation Factorial Fibonacci Number Primality Test Euclidean Algorithm Least Common Multiple Sieve of Eratosthenes Is Power of Two Pascal's Triangle Complex Number Radian & Degree Fast Powering Integer Partition Liu Hui π Algorithm Discrete Fourier Transform Cartesian Product Fisher–Yates Shuffle Power Set Permutations Combinations Longest Common Subsequence Longest Increasing Subsequence Shortest Common Supersequence Knapsack Problem Maximum Subarray Combination Sum Hamming Distance Levenshtein Distance Knuth–Morris–Pratt Algorithm Z Algorithm Rabin Karp Algorithm Longest Common Substring Regular Expression Matching Linear Search Jump Search Binary Search Interpolation Search Bubble Sort Selection Sort Insertion Sort Heap Sort Merge Sort Quicksort Shellsort Counting Sort Radix Sort Straight Traversal Reverse Traversal Depth-First Search Breadth-First Search Depth-First Search Breadth-First Search Kruskal’s Algorithm Dijkstra Algorithm Bellman-Ford Algorithm Floyd-Warshall Algorithm Detect Cycle Prim’s Algorithm Topological Sorting Articulation Points Bridges Eulerian Path and Eulerian Circuit Hamiltonian Cycle Strongly Connected Components Travelling Salesman Problem Polynomial Hash Tower of Hanoi Square Matrix Rotation Jump Game Unique Paths Rain Terraces Recursive Staircase N-Queens Problem Knight's Tour
Updated on
May 25, 2020
Books & Reference
Data safety
arrow_forward
Safety starts with understanding how developers collect and share your data. Data privacy and security practices may vary based on your use, region, and age. The developer provided this information and may update it over time.