Pointerless implementation of Range Tree.
Works by first sorting using Bitonic Sort. Graph below shows the execution time of CPU(Xeon E5) and GPU(Quadro K620) algorithms.
And Then merging the sorted arrays to form Secondary Trees using Merge Path Algorithm.
The graph here shows combined results.
(in all the graphs above- X axis: log(# of points), Y axis:(Milliseconds) )