Display title | Bitonic sorter |
Default sort key | Bitonic sorter |
Page length (in bytes) | 8,808 |
Namespace ID | 0 |
Page ID | 231176 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
Page image |  |
HandWiki item ID | None |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | imported>LinuxGuru |
Date of page creation | 00:39, 7 February 2024 |
Latest editor | imported>LinuxGuru |
Date of latest edit | 00:39, 7 February 2024 |
Total number of edits | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was devised by Ken Batcher. The resulting sorting networks consist of $ O(n\log ^{2}(n)) $ comparators and have a delay of $ O(\log ^{2}(n)) $, where $ n $ is... |