JavaScript algorithms and data structures

• Stack dynamic array
• Stack fixed size array
• Stack linked list
• Stack two queues

• Queue dynamic array
• Queue fixed size array
• Queue circular fixed size array
• Queue linked list
• Queue two stacks

• Deque dynamic array
• Deque circular fixed size array

• Singly linked list
• Doubly linked list
• Circular singly linked list
• Circular doubly linked list

• Convert number - iterative solution
• Convert number - recursive solution
• Factorial
• Fibonacci - iterative solution
• Fibonacci - recursive worst solution
• Fibonacci - recursive memoization
• Fibonacci - recursive solution
• Fibonacci sum - iterative solution
• Fibonacci sum - recursive solution
• Maze path finder
• Reverse array iterative
• Reverse array recursive
• Reverse linked list iterative stack
• Reverse linked list iterative
• Reverse linked list recursive
• Sum numbers in array pointer
• Sum numbers in array binary recursion
• Towers of Hanoi

• Sequential search
• Sequential search sorted array
• Binary search recursive
• Binary search recursive pointers
• Binary search iterative

• Open adressing
• Chaining

• Bubble sort
• Short bubble
• Insertion sort
• Selection sort
• Merge sort
• Quick sort

• Binary heap - min heap implementation
• Binary search tree
• AVL tree

• Breadth first search
• Depth first search
  • Depth first search stack
  • Depth first search recursive
• Test for connectivity
• Cycle detection
  • Cycle detection undirected graph
  • Cycle detection directed graph
• Topological sorting
• Minimum spanning tree
  • Minimum spanning tree in undirected graph
  • Prim's algorithm - Minimum spanning tree in undirected weighted graph
  • Kruskal's algorithm - Minimum spanning tree in undirected weighted graph
• Dijkstra shortest path
  • Dijkstra priority queue implementation
  • Dijkstra matrix implementation
• Union find
• Bellman-Ford
• Kosaraju's algorithm

• Trie