58
edits
Changes
K2
,→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.(https://en.wikipedia.org/wiki/Bitonic_sorter)
[[File:bitonic3.jpg|500px|thumb|left|The process of bitonic algorithm]]
(https://www.geeksforgeeks.org/bitonic-sort/)
'''Analysis and Profiling'''
