Changes

Jump to: navigation, search

K2

360 bytes added, 03:50, 1 April 2018
Assignment1
==Assignment1==
 
What is Bitonic sorting algorithm?
 
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 the number of items to be sorted.
58
edits

Navigation menu