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.
Public GitHub Catalog
Discovered Oct 1, 2026
dmsehuang / algorithm_patternRecognition
Princeton Algorithm Course. Draw lines if it contains more than 4 points.
About this discovery
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
#22746052GitHub System ID
dmsehuangOrganization / User
PublicVisibility
ActiveCatalog Status
More from dmsehuang
dmsehuang/algorithm_8puzzle
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
dmsehuang/algorithm_queues
Coursera algorithm assignment 2, linkedlist implementation of deque & array implementation of randomized queue with resize feature
dmsehuang/algorithm_percolation
Coursera algorithm assignment 1, percolation, it uses two unionFind object, not an elegant solution, but it got full score