dmsehuang/algorithm_kdtree
implement kdtree using BST tree. Construct private static Node as the data structure to store the data. Implement the range() and nearest() API.
1st_version
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
implement kdtree using BST tree. Construct private static Node as the data structure to store the data. Implement the range() and nearest() API.
This algorithm assignment is to solve the 8 puzzle problem (http://en.wikipedia.org/wiki/15_puzzle) using priority queues. The API defined in the assignment is awesome
Princeton Algorithm Course. Draw lines if it contains more than 4 points.
Coursera algorithm assignment 2, linkedlist implementation of deque & array implementation of randomized queue with resize feature