I have an array of ints. The values are either greater than or equal to 0 and the other set of values is -1.
So the data looks like :
0 1 2 3 -1 -1 -1 -1 -1 5 6 6 -1 -1 -1
I want this to be sorted so that all the positive numbers are first and then the -1’s are last. I’d prefer to have the positive numbers be ordered least to greatest but I did begrudgingly use largest to least last time I did this.
Is there a way to get this data the way that I want with just one kernel or just one call to a thrust algorithm?