(int a[], int low, int cnt, int dir)
| 29 | } |
| 30 | |
| 31 | void bitonicSort(int a[], int low, int cnt, int dir) |
| 32 | { |
| 33 | if (cnt>1) |
| 34 | { |
| 35 | int k = cnt/2; |
| 36 | |
| 37 | // sort in ascending order since dir here is 1 |
| 38 | bitonicSort(a, low, k, 1); |
| 39 | |
| 40 | // sort in descending order since dir here is 0 |
| 41 | bitonicSort(a,low+k, k, 0); |
| 42 | |
| 43 | // Will merge whole sequence in ascending order |
| 44 | // since dir=1. |
| 45 | bitonicMerge(a, low, cnt, dir); |
| 46 | } |
| 47 | } |
| 48 | |
| 49 | void sort(int a[], int N, int up) |
| 50 | { |