Parallel sorting is so fast compared to sequential sorting, given you have have the processors. This implementation of Bitonic sort uses CUDA to achieve monsterous performance.
-
Notifications
You must be signed in to change notification settings - Fork 0
Hawzen/CUDA-Bitonic-Sort
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
CUDA bitonic sort implementation
Topics
Resources
Stars
Watchers
Forks
Packages 0
No packages published