study
├── array-manipulation
│   # Search max contiguous value and the smallest missing value.
├── binary-gap
│   # Finds the longest sequence of zeroes in array.
├── binary-search-tree
│   # The ever favority binary search tree
├── bit-manipulation
│   # Bit manipulation demonstration
├── bubble-sort
│   # Does a bubble demonstration
├── dijkstra-shortest-path
│   # Find shortest path using Dijkstra algorithm
├── fibonacci
│   # Computing fibonacci value
├── fizzbuzz
│   # Does a fizzbuzz sequence
├── flood-fill
│   # Maze solving algorithm flood fill.
├── pascals-triangle
│   # Building a pascal triangle
├── product-code
│   # Linked listing a product code
├── quick-sort
│   # Does a quick sort demonstration
└── root-mean-square-error
    # Computes the root mean square error value

%> make study MODULE=root-mean-square-error

%> ./bin/root-mean-square-error 
Predicted: { 4.00 25.00 0.75 11.00  }
Observed : { 3.00 21.00 -1.25 13.00  }
Root-Mean-Square Error: 2.500