trekhleb /javascript-algorithms

📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings

★ 196,728⑂ 30,973👁 4,175⑃ 897● 385▤ 0
JavaScriptMITCreated 2018-03-24
More from this author
+2
Daily
+6
Weekly
+49
Monthly
196,728
stars
30,973
forks
4,175
watchers
897
prs
385
issues
0
releases

README

JavaScript Algorithms and Data Structures

 🇺🇦 UKRAINE IS BEING ATTACKED BY RUSSIAN ARMY. CIVILIANS ARE GETTING KILLED. RESIDENTIAL AREAS ARE GETTING BOMBED.
 - Help Ukraine via:
   - Serhiy Prytula Charity Foundation
   - Come Back Alive Charity Foundation
   - National Bank of Ukraine
 - More info on war.ukraine.ua and MFA of Ukraine





!repo size

This repository contains JavaScript based examples of many
popular algorithms and data structures.

Each algorithm and data structure has its own separate README
with related explanations and links for further reading (including ones
to YouTube videos).

_Read this in other languages:_
_简体中文_,
_繁體中文_,
_한국어_,
_日本語_,
_Polski_,
_Français_,
_Español_,
_Português_,
_Русский_,
_Türkçe_,
_Italiano_,
_Bahasa Indonesia_,
_Українська_,
_Arabic_,
_Tiếng Việt_,
_Deutsch_,
_Uzbek_,
_עברית_

 Data Structures

A 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.

Remember that each data has its own trade-offs. And you need to pay attention more to why you're choosing a certain data structure than to how to implement it.

B - Beginner, A - Advanced

 B Linked List
 B Doubly Linked List
 B Queue
 B Stack
 B Deque - double-ended queue
 B Hash Table
 B Heap - max and min heap versions
 B Priority Queue
 A Trie
 A Tree
   A Binary Search Tree
   A AVL Tree
   A Red-Black Tree
   A Segment Tree - with min/max/sum range queries examples
   A Fenwick Tree (Binary Indexed Tree)
 A Graph (both directed and undirected)
 A Disjoint Set - a union–find data structure or merge–find set
 A Bloom Filter
 A LRU Cache - Least Recently Used (LRU) cache

 Algorithms

An algorithm is an unambiguous specification of how to solve a class of problems. It is
a set of rules that precisely define a sequence of operations.

B - Beginner, A - Advanced

 Algorithms by Topic

 Math
   B Bit Manipulation - set/get/update/clear bits, multiplication/division by two, make negative etc.
   B Binary Floating Point - binary representation of the floating-point numbers.
   B Factorial
   B Fibonacci Number - classic and closed-form versions
   B Prime Factors - finding prime factors and counting them using Hardy-Ramanujan's theorem
   B Primality Test (trial division method)
   B Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)
   B Least Common Multiple (LCM)
   B Sieve of Eratosthenes - finding all prime numbers up to any given limit
   B Is Power of Two - check if the number is power of two (naive and bitwise algorithms)
   B Pascal's Triangle
   B Complex Number - complex numbers and basic operations with them
   B Radian & Degree - radians to degree and backwards conversion
   B Fast Powering
   B Horner's method - polynomial evaluation
   B Matrices - matrices and basic matrix operations (mul

Top issues

Snapshot: 2026-11-16T09:23:14Z · Data license Apache-2.0 · JSON