What is a implementation on n numbers of term in bubble sorting?

Answer 1

void bubblesort (int* array, int size) {

if (!array size<2) return;

int last_swap = size;

while (last_swap>0) {

int n=last_swap;

for (int i=1; i<last_swap; ++i) {

if (array[i]<array[i-1]) {

array[i]^=array[i-1]^=array[i]^=array[i-1];

n=i;

}

last_swap = n;

}

}