Difference between revisions of "K2"
(→Assignment1) |
(→Assignment1) |
||
| Line 7: | Line 7: | ||
==Assignment1== | ==Assignment1== | ||
| − | What is Bitonic sorting algorithm? | + | '''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. | 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. | ||
| + | |||
| + | [[File:bitonic3.jpg]] | ||
Revision as of 03:59, 1 April 2018
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.
