algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-06 00:54:32 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #50 from UsernameToLon/BubbleSort

Browse Source 
Bubble sort updated to efficient version
This commit is contained in:
Anup Kumar Panwar
2017-05-19 08:27:04 +05:30
committed by GitHub
parent 1bd077ea41 b829bc6a25
commit 4e14531e07
1 changed files with 21 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
Sorts/BubbleSort.java
View File

@ -16,8 +16,12 @@ class BubbleSort
*/
public static void main(String[] args)
{
int array[]=new int[6];
int size = 6;
int array[]=new int[size];
boolean swap;
int last = size - 1;
Scanner input=new Scanner(System.in);
//Input
System.out.println("Enter any 6 Numbers for Unsorted Array : ");
@ -27,18 +31,22 @@ class BubbleSort
}
//Sorting
for(int i=0; i<5; i++)
{
for(int j=i+1; j<6; j++)
{
if(array[j]>array[i])
{
int temp=array[j];
array[j]=array[i];
array[i]=temp;
}
}
}
do
{
swap = false;
for (int count = 0; count < last; count++)
{
if (array[count] > array[count + 1])
{
int temp = array[count];
array[count] = array[count + 1];
array[count + 1] = temp;
swap = true;
}
}
last--;
} while (swap);
//Output
for(int i=0; i<6; i++)