At its heart is repeated use of the butterfly structure. The algorithm proceeds by building sequences of keys that form a bitonic sequence: a sequence that first increases, and then decreases. It then uses butterfly structures to sort a bitonic sequence into either a decreasing or increasing sequence. https://en.wikipedia.org/wiki/Bitonic_sorter
-
Notifications
You must be signed in to change notification settings - Fork 0
Bitonic mergesort
License
timxor/parallel_bitonic_sorter
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Bitonic mergesort
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published