bubble sort in java please explain
Answers
Java Program for Bubble Sort. Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
Explanation:
The bubble sort swaps the adjacent elements of the array . If the array has to be in ascending order then the adjacent element will be swapped so that the array becomes ascending and vice versa .
This technique is better and faster than selection sort .
CODE
import java.util.*;
class bubble_sort
{
int n;
int arr[]=new int[n];
int b[]=new int[n];
public static void main(String args[])
{
accept();
}
void accept()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number of elements");
n=sc.nextInt();
System.out.println("Enter the array elements");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
b[i]=arr[i];
}
sort();
}
void sort()
{
for(int i=0;i<n-1;i++)
{
for(int j=0;j<(n-1-i);j++)
{
if(arr[j]>arr[j+1])
{
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
disp();
}
void disp()
{
System.out.println("The elements in the array are arranged in acending:");
for(int i=0;i<n;i++)
{
System.out.println(arr[i]);
System.out.println(b[i]);
}
}
}