Random codes that I want to keep around for future reference

BST

implementation of most of the methods for a Binary Search Tree

Heap

Heap and its methods implementation, including heap-sort even though it is not exactly a heap method

Sorting

Implementation of: quick_sort, merge_sort

Examples

  require_relative 'sort'
  merge_sort([1,5,43,33,32])
  quick_sort([3,2,3,0,0])

Deal Crawler

Basic crawler that only search for specific brands on the deal websites, can run on a crontab