Machine Learning, AI and Programming

Tag: QuickSort

Constructing Binary Search Trees on the GPU

Binary Search Trees (BST) are one of the very important data structures required for effecient searching (lookup) and sorting problems. In machine learning, BSTs or variants of BSTs are used widely for various tasks such as fast nearest neighbor lookups (KD-Trees), Decision Trees etc. BSTs have an average case time complexity of O(logN) for searching where N is the number of possible values to search, but can go upto O(N) […]

Continue Reading →