GitHub - trekhleb/javascript-algorithms: Algorithms and data structures implemen...
source link: https://github.com/trekhleb/javascript-algorithms
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
README.md
JavaScript Algorithms and Data Structures
This repository contains JavaScript based examples of many popular algorithms and data structures.
Each algorithm and data structure have its own separate README with related explanations and links for further reading and YouTube videos.
Data Structures
Data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
- Linked List
- Queue
- Stack
- Hash Table
- Heap
- Priority Queue
- Trie
- Tree
- Binary Search Tree
- AVL Tree
- Red-Black Tree
- Suffix Tree
- Segment Tree or Interval Tree
- Binary Indexed Tree or Fenwick Tree
- Graph (both directed and undirected)
- Disjoint Set
Algorithms
Algorithm is an unambiguous specification of how to solve a class of problems. Algorithm is a set of rules that precisely defines a sequence of operations.
Algorithms by Topic
- Math
- Factorial
- Fibonacci Number
- Primality Test (trial division method)
- Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)
- Least Common Multiple (LCM)
- Integer Partition
- Sets
- Cartesian Product - product of multiple sets
- Power Set - all subsets of the set
- Permutations (with and without repetitions)
- Combinations (with and without repetitions)
- Fisher–Yates Shuffle - random permutation of a finite sequence
- Longest Common Subsequence (LCS)
- Longest Increasing subsequence
- Shortest Common Supersequence (SCS)
- Knapsack Problem - "0/1" and "Unbound" ones
- Maximum Subarray - "Brute Force" and "Dynamic Programming" (Kadane's) versions
- String
- Levenshtein Distance - minimum edit distance between two sequences
- Hamming Distance - number of positions at which the symbols are different
- Knuth–Morris–Pratt Algorithm - substring search
- Rabin Karp Algorithm - substring search
- Longest Common Substring
- Search
- Sorting
- Tree
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Graph
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Dijkstra Algorithm - finding shortest path to all graph vertices
- Bellman-Ford Algorithm - finding shortest path to all graph vertices
- Detect Cycle - for both directed and undirected graphs (DFS and Disjoint Set based versions)
- Prim’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph
- Kruskal’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph
- Topological Sorting - DFS method
- Articulation Points - Tarjan's algorithm (DFS based)
- Bridges - DFS based algorithm
- Eulerian Path and Eulerian Circuit - Fleury's algorithm - Visit every edge exactly once
- Hamiltonian Cycle - Visit every vertex exactly once
- Strongly Connected Components - Kosaraju's algorithm
- Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin city
- Uncategorized
Algorithms by Paradigm
An algorithmic paradigm is a generic method or approach which underlies the design of a class of algorithms. It is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.
- Brute Force - look at all the possibilities and selects the best solution
- Maximum Subarray
- Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin city
- Greedy - choose the best option at the current time, without any consideration for the future
- Unbound Knapsack Problem
- Dijkstra Algorithm - finding shortest path to all graph vertices
- Prim’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph
- Kruskal’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph
- Divide and Conquer - divide the problem into smaller parts and then solve those parts
- Binary Search
- Tower of Hanoi
- Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)
- Permutations (with and without repetitions)
- Combinations (with and without repetitions)
- Merge Sort
- Quicksort
- Tree Depth-First Search (DFS)
- Graph Depth-First Search (DFS)
- Dynamic Programming - build up to a solution using previously found sub-solutions
- Fibonacci Number
- Levenshtein Distance - minimum edit distance between two sequences
- Longest Common Subsequence (LCS)
- Longest Common Substring
- Longest Increasing subsequence
- Shortest Common Supersequence
- 0/1 Knapsack Problem
- Integer Partition
- Maximum Subarray
- Bellman-Ford Algorithm - finding shortest path to all graph vertices
- Backtracking - similarly to brute force try to generate all possible solutions but each time you generate a solution test
if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise backtrack and go on a
different path of finding solution
- Hamiltonian Cycle - Visit every vertex exactly once
- N-Queens Problem
- Knight's Tour
- Branch & Bound
How to use this repository
Install all dependencies
npm install
Run all tests
npm test
Run tests by name
npm test -- -t 'LinkedList'
Playground
You may play with data-structures and algorithms in ./src/playground/playground.js file and write
tests for it in ./src/playground/__test__/playground.test.js.
Then just simply run the following command to test if your playground code works as expected:
npm test -- -t 'playground'
Useful Information
References
▶ Data Structures and Algorithms on YouTube
Big O Notation
Order of growth of algorithms specified in Big O notation.
Source: Big O Cheat Sheet.
Below is the list of some of the most used Big O notations and their performance comparisons against different sizes of the input data.
Big O Notation Computations for 10 elements Computations for 100 elements Computations for 1000 elements O(1) 1 1 1 O(log N) 3 6 9 O(N) 10 100 1000 O(N log N) 30 60 9000 O(N^2) 100 10000 1000000 O(2^N) 1024 1.26e+29 1.07e+301 O(N!) 3628800 9.3e+157 4.02e+2567Data Structure Operations Complexity
Data Structure Access Search Insertion Deletion Array 1 n n n Stack n n 1 1 Queue n n 1 1 Linked List n n 1 1 Hash Table - n n n Binary Search Tree n n n n B-Tree log(n) log(n) log(n) log(n) Red-Black Tree log(n) log(n) log(n) log(n) AVL Tree log(n) log(n) log(n) log(n)Array Sorting Algorithms Complexity
Name Best Average Worst Memory Stable Bubble sort n n^2 n^2 1 Yes Insertion sort n n^2 n^2 1 Yes Selection sort n^2 n^2 n^2 1 No Heap sort n log(n) n log(n) n log(n) 1 No Merge sort n log(n) n log(n) n log(n) n Yes Quick sort n log(n) n log(n) n^2 log(n) No Shell sort n log(n) depends on gap sequence n (log(n))^2 1 NoRecommend
-
172
maybe-baby 2.x will be maintained, however, if possible for your repository, you should opt to use TypeScript's optional...
-
29
GitHub is where people build software. More than 27 million people use GitHub to discover, fork, and contribute to over 80 million projects.
-
43
README.md Machine Learning in MatLab/Octave This repository contains MatLab/Octave examples of popular machine learning algorithms with code examples a...
-
9
CoursesECMAScript, or ES, is a standardized version of JavaScript. Because all major browsers follow this specification, the terms ECMAScript and JavaScript are interchangeable.Most of the JavaScript you've learned u...
-
5
Weighted Random What is "Weighted Random" Let's say you have a list of items. Item could be anything. For example, we may have a list of fruits and vegetables that you like to eat: [ '🍌', '🍎', '🥕' ]
-
9
When we talk about data structures in JavaScript, we can't get past the most important structure of this language – the object. Let's take a look at what it has under the hood and why hashing algorithms are needed. Associative...
-
6
# Mahamudra.Cryptography.Notation [Photo by Tezos on Unsplash] EncodeBase58 What is Base58 encoding? Base58 is a binary-to-text encoding created by Satoshi Nakamoto for Bitcoin addresses. The original Bitcoin...
-
9
1. Arrays. An array is a single variable in JavaScript that keeps numerous elements,unlike other languages where array is a reference to several variables. When we wish to keep a list of elements and retrieve them with a sing...
-
6
BFFS - Backend for Frontend Shield BFFS is a simple project built with Laravel that implements the...
-
10
If you're looking to get your JavaScript skills to the next level, you're in the right place. Let's jump right in! 🎉 What are Data Structures? 🤔 Data structures are like the different ty...
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK