Sorting pairs of numbers using AMP

[zoran404]

I need numbers next to each other to be sorted (in increasing order).
On the CPU I'd do something like this:

for(int i=0; i < length; i+=2) {
    if(a[i]>a[i+1]) {
        switch places...
    }
}

But how would I do this using parallel_for_each (C++AMP) ?

I need this for some algorithm that works with very long arrays and I think GPU would do this faster than CPU (even if I use all threads).

[keskiverto]

Try websearch with "GPGPU sort".

[zoran404]

My question is: is there a way to execute the kernel for every Second element of an array?

[keskiverto]

Of course. Lets say that you have N threads. Each has index from [0..N[

You have array with at least 2*N elements.

Let kernel compute: int arrayIndex = 2*threadIndex;