what is the algorithm of bubble sort?

Answer 1

Here's a bubble sort in one version of BASIC. It assumes an earlier statement of : DEFINT C-L:DEFSTR M-Z:DEFDBL A

1960 'sort ELEMENTS of an array, ascending (bubble-sort)
1970 ' call: A(n)= array, F= 1st position, L= last position
1980 ' exit: A(n)= sorted, ascending, positions F thru L
1990 ' temp: E= Exit, I= Incr
2000 FOR E=-1 TO 0
2010 FOR I=F TO L-1
2020 IF A(I)>A(I+1) THEN SWAP A(I),A(I+1):L=I
2030 NEXT
2040 E=L 2050 NEXT
2060 '

Answer 2

function bubble_sort(list L, number listsize)
loop
has_swapped := 0 //reset flag
for number i from 1 to (listsize - 1)
if L[i] > L[i + 1] //if they are in the wrong order
swap(L[i], L[i + 1]) //exchange them
has_swapped := 1 //we have swapped at least once, list may not be sorted yet
endif
endfor
//if no swaps were made during this pass, the list has been sorted
if has_swapped = 0
exit
endif
endloop
endfunction

Answer 3

void bubbleSort(int numbers[], int array_size)
{
int i, j, temp;

for (i = (array_size - 1); i >= 0; i--)
{
for (j = 1; j <= i; j++)
{
if (numbers[j-1] > numbers[j])
{
temp = numbers[j-1];
numbers[j-1] = numbers[j];
numbers[j] = temp;
}
}
}
}