Answers.com > Wiki Answers > Categories > Technology > Computers > Computer Programming > What example of bubble sort?

What example of bubble sort?

In: Computer Programming, Java Programming, C Programming [Edit categories]

Answer:

procedure bubbleSort( A : list of sortable items ) defined as:
do
swapped := false
for each i in 0 to length(A) - 1 inclusive do:
if A[i] > A[i+1] then
swap( A[i], A[i+1] )
swapped := true
end if
end for
while swapped
end procedure

First answer by Vafloyd. Last edit by Vafloyd. Contributor trust: 79 [recommend contributor ]. Question popularity: 1 [recommend question].

[report abuse]

Can you answer these Computer Programming questions?

	What are the advantages and disadvantages of Hacker?	Answer it!
	Who improved the computer?	Answer it!
	What is execution of program?	Answer it!
	What is easier parallel algorithms or pattern recognition?	Answer it!
	Why machine language is called low level language?	Answer it!

Relevant answers:

What is bubble sort and explain with examples?
bubbles
About bubble sort?
bubblesort(int[] unsortedList){ 1)for(int i=1; i<unsortedList.length(); i++){ 2) for(int J=i+1; j<=unsortedList.length(); j++){ 3) if (unsortedList[i]>unsortedList[j]){ 4) int temp =...
Frame sort implementation by bubble sort?
/* Frame sorting using bubble sort */ // By Sandeep #include<stdio.h> #include<conio.h> //defining frame structure struct frame { int frameno; char msg[90]; }; void main() { struct frame...
What is bubble sort?
Bubble sort is a sorting algorithm that compares 2 adjacent items at a time, starting from the beginning of a list, and swapping them if they are out of sequence. Each comparison gradually moves the...
Bubble sort in c?
Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they...