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) )
-
Notifications
You must be signed in to change notification settings - Fork 0
Shikhar-S/Range-Tree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Pointerless implementation of Range Tree.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published