#Algorithms in Ruby (mostly) and Javascript

What is this code?

This is a collection of scripts I put together while exploring different data structures and algorithms.
They include many useful and classic examples that are used in many applications.

Structure of the repository

I thought it would be useful to divide scripts based either on application or data structure

###Graphs###

• Union Find
• Union Find - While vs Recursion Benchmark
• Find Strong Connected Components in a Graph
• Find the Minimum Cut in a Graph
• Use BFS in a Graph to find path in a maze
• Dijkstra find shortest path for a vertex to all other

###Tree like structures###

• Heap (min heap)
• Heap (max heap)
• HeapMedian - maintain the median using 2 heaps

###Hash Table###

• Using a hash table to solve the 2sum problem
• NOT using a hash table to solve 2sum problem the code not using the hash table to narrow down the values is not as elegant but about 350% faster!

###List structures###

• Stack
• Queue

###Sorting###

• Merge Sort
  • Count Inversions Made by Merge Sort
• Quick Sort
  Count Comparisons made by Quick Sort depending on the choice of pivot
  • Quick Sort - pivot: first element
  • Quick Sort - pivot: last element
  • Quick Sort - pivot: median element
• Quick Sort JS

###Misc - other interesting problems solved with algorithms###

• Solve the Tower of Hanoi problem

all the data used can be found in the test_data directory