32 for (
size_t i = 0; i < N - 1; i++) {
33 if (a[i] > a[i + 1]) {
35 a[i + 1] = a[i] - a[i + 1];
55 for (
int i = -bound; i <= bound; i++) {
56 for (
int j = -bound; j <= bound; j++) {
57 v[k++] = nbr.at(nbr.I_c + i, nbr.I_r + j);
void bubbleSort(T &a, int N)
@ size
number of backends.