Sort algorithms bubble sort

Sort Algorithms
Bubble Sort
Java programming
2018-1
1

Question?
Write a java program to sort an array elements
using bubble sort algorithm?
Input: 18 9 33 4 84 32
Output: 4 9 18 32 33 84
2

Bubble sort algorithm
• array is traversed from first element to last
element.
• current element is compared with the next
element.
• If current element is greater than the next
element, it is swapped.
3

public class BubbleSortExample {
static void bubbleSort(int[] arr) {
int n = arr.length;
int temp = 0;
for(int i=0; i < n; i++){
for(int j=1; j < (n-i); j++){
if(arr[j-1] > arr[j]){
//swap elements
temp = arr[j-1];
arr[j-1] = arr[j];
arr[j] = temp;
}
}
}
}
public static void main(String[] args) {
int arr[] ={3,60,35,2,45,320,5};
System.out.println("Array Before Bubble Sort");
for(int i=0; i < arr.length; i++){
System.out.print(arr[i] + " ");
}
bubbleSort(arr); //sorting array elements
System.out.println("Array After Bubble Sort");
for(int i=0; i < arr.length; i++){
System.out.print(arr[i] + " ");
}
}
}
4

//swap elements
temp = X;
X = Y;
Y = temp;
5

Is A>B ?
for(int K=0; K < n; K++){
for(int i=0; i < (n-K); i++){
j=i+1;
if(arr[i] > arr[j]) swap
}
}
K=0, I=0 , J=1

Is B >C ?
I=1 , J=2
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=2 , J=3
Is C >D ?
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=2 , J=3
Swap
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=3 , J=4
Is C >E ?
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=4 , J=5
Is E >F ?
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

Next round
K=1
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=0 , J=1
Is A >B ?
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=1 , J=2
Is B >D ?
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=1 , J=2
Swap
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

I=2 , J=3
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Is B >C ?

I=3 , J=4
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Is C >E ?

K=2
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Next round

I=0 , J=1
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Is A >D ?

I=1 , J=2
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Is A >B ?

I=3 , J=4
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Is B >C ?

K=3
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Next round

I=0 , J=1
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Is D >A ?

K=4
for(int i=0; i < (n-K); i++){
j=i+1;
}
}
Next round

Is D > A ?
I=0 , J=1
for(int i=0; i < (n-K); i++){
j=i+1;
}
}

Sort algorithms bubble sort

Recommended

Recommended

More Related Content

More from zahraa F.Muhsen

More from zahraa F.Muhsen (20)

Sort algorithms bubble sort