A divide and conquer algorithm that finds the closest pair of points in a set. Runs in time O(nlogn).
A hash table that maps strings to specific positions in the table based on the hashing.
A priority queue that implements methods that are used for Dijkstra's shortest paths algorithm.
A singly-linked skip list which implements insertion, deletion, and search.
A logistic regression algorithm that uses gradient descent to learn a model.
Implemented the adaboost algorithm.
Bagged Decision Trees
Implemented bagged decision trees for computing out-of-bag error.