Paralel Birleştirme ve Ağlar (Parallel Merging & Networks) Algoritması

1export function compareAndSwap(arr: number[], i: number, j: number, dir: boolean): void {
2  // dir = true for ascending, false for descending
3  if ((arr[i] > arr[j] && dir) || (arr[i] < arr[j] && !dir)) {
4    const temp = arr[i];
5    arr[i] = arr[j];
6    arr[j] = temp;
7  }
8}
9
10export function bitonicMerge(arr: number[], low: number, cnt: number, dir: boolean): void {
11  if (cnt > 1) {
12    const k = cnt / 2;
13    for (let i = low; i < low + k; i++) {
14      compareAndSwap(arr, i, i + k, dir);
15    }
16    bitonicMerge(arr, low, k, dir);
17    bitonicMerge(arr, low + k, k, dir);
18  }
19}
20
21export function bitonicSort(arr: number[], low: number, cnt: number, dir: boolean): void {
22  if (cnt > 1) {
23    const k = cnt / 2;
24    // Sort in ascending order
25    bitonicSort(arr, low, k, true);
26    // Sort in descending order
27    bitonicSort(arr, low + k, k, false);
28    // Merge the whole sequence
29    bitonicMerge(arr, low, cnt, dir);
30  }
31}