Skip to content

pmulard/data-structures-and-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

4 Commits
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

This is a collection of data structures and algorithms implemented in JavaScript (mainly), Python, and Rust. The Python and Rust versions are a work in progress, and only exist for the core sorting and searching algorithms. Everything has at least a JavaScript version.

Why write these all from scratch, especially when there are many implementations written across the internet? I did this mainly to gain a deeper understanding of how each works and for practice.

🟑 => JavaScript
πŸ”΅ => Python
🟠 => Rust

Data Structures

Stack 🟑
Queue 🟑
Priority Queue 🟑
Singly Linked List 🟑
Doubly Linked List 🟑
Hash Table 🟑
Binary Search Tree (BST) 🟑
Binary Heap 🟑
Trie (Prefix Tree) 🟑
Graph 🟑
Adjacency List 🟑

Algorithms

Sorting

Selection Sort πŸŸ‘πŸ”΅πŸŸ 
Bubble Sort πŸŸ‘πŸ”΅πŸŸ 
Insertion Sort πŸŸ‘πŸ”΅πŸŸ 
Merge Sort πŸŸ‘πŸ”΅πŸŸ 
Quicksort πŸŸ‘πŸ”΅πŸŸ 
Radix Sort 🟑

Searching

Linear Search πŸŸ‘πŸ”΅πŸŸ 
Binary Search πŸŸ‘πŸ”΅πŸŸ 
Breadth First Search (BFS) 🟑
Depth First Search (DFS) 🟑
Top K Elements 🟑

Graphs

Topological Sort 🟑
Dijkstra's Algorithm 🟑

About

a collection of data structures and algorithms written in JavaScript, Python and Rust

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published