I'm not sure how I would perform a bitonic sort on a two-dimensional hypercube with 12 numbers.
Suppose I had the input 2 28 6 34 9 7 15 23 4 10 12 25.
Since it's a two-dimensional hypercube, I assumed that there would be 4 processors. So I distributed the input amongst the processors like this:
2
28
6
34
9
7
15
23
4
10
12
25
I tried to follow the steps starting on page 12 of this document. The problem is, in their case they have the same amount of processors $(p)$ as the items to be sorted ($n$). In my case, $n > p$, so each processor has more than one element, 3 in this case.
How can I perform the bitonic sort in this scenario?
