K2

From CDOT Wiki
Revision as of 05:03, 1 April 2018 by Kjin3 (talk | contribs) (Assignment1)
Jump to: navigation, search

Team members


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.

The process of bitonic algorithm