Information for "Bitonic sorter"

From HandWiki

Basic information

Display titleBitonic sorter
Default sort keyBitonic sorter
Page length (in bytes)8,808
Namespace ID0
Page ID231176
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Page imageBatcher Bitonic Mergesort for eight inputs.svg
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>LinuxGuru
Date of page creation00:39, 7 February 2024
Latest editorimported>LinuxGuru
Date of latest edit00:39, 7 February 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (19)

Templates used on this page:

SEO properties

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...
Information from Extension:WikiSEO