Data Structures & Algorithms [WIP]

Data structure algorithm implementations for learning in various programming languages

🗃 Project Index

Category	Algorithm	Javacsript	Java	Python
Union-Find	Weighted Quick-Union UF	✅	✅
Sort	Knuth Shuffle	✅
Sort	Insertion Sort	✅
Sort	Mergesort	✅
Sort	Quicksort	✅
Binary Heap	Priority Queue	✅
Binary Heap	Heapsort	✅
Linked List	Singly Linked List	✅
Tree	BinaryTree	✅
Tree	BinarySearchTree	✅

🗃 Project Structure

• 📂 javascript/
  • 📂 union_find/
    • 📄 weighted_quick_union_uf.js: UnionFind with improvements:
      • ✅ Quick-Union algorithm
      • ✅ Weighted sub-trees
      • ✅ Path compression
  • 📂 sort/
    • 📄 sortable.js: Base class with common utility methods for array-based sorting algorithms.
    • 📄 knuth_shuffle.js: Knuth shuffle algorithm for arrays.
    • 📄 insertionsort.js: Insertion sort algorithm for arrays.
    • 📄 mergesort.js: Mergesort algorithm for arrays with improvements:
      • ✅ Insertion Sort for smaller subarrays
      • ✅ Stop early if already sorted
      • 🔲 Eliminate copy of auxiliary array
    • 📄 quicksort.js: Quicksort algorithm for arrays with improvements:
      • ✅ Initial shuffle for performance guarantee
      • ✅ Insertion Sort for smaller subarrays
      • ✅ Median-of-3-samples to find optimal partition element
  • 📂 binary_heap/
    • 📄 priority_queue.js: Priority Queue implementation using a Binary Heap data-structure.
    • 📄 heap_sort.js: Heapsort implementation using a Binary Heap data-structure.
  • 📂 linked_list/
    • 📄 linked_list.js: A singly-linked-list implementation.
  • 📂 tree/
    • 📄 binary_tree.js: BinaryTree class implementation.
    • 📄 binary_search_tree.js: BinarySearchTree class implementation by extending the BinaryTree class.