Changes

K2

18 bytes added, 01:55, 16 April 2018

→‎Assignment1

The bitonic sorting algorithm is devised for the input length n being a power of 2.

To check the noticeable time gap, we put 2^1516, 2^20, 2^2524.

void bitonicSort(int* array, int N){

Below is the comparison between bitonic sort using GPU, quick sort using CPU, bitonic sort using CPU.

[[File:BitonicGraph.jpg|500px|thumb|left|sorting algorithms comparison result]]

58

edits