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

Updated to more efficient version if array size is scaled.

Browse Source 
Changed loop from "for" to "do-while". Added decrement at end of do loop to decrease size of array tested after each iteration.
This commit is contained in:
UsernameToLon
2017-05-18 14:11:47 -04:00
committed by GitHub
parent 1bd077ea41
commit e5dd6eff02
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) 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); Scanner input=new Scanner(System.in);
//Input //Input
System.out.println("Enter any 6 Numbers for Unsorted Array : "); System.out.println("Enter any 6 Numbers for Unsorted Array : ");
@ -27,18 +31,22 @@ class BubbleSort
} }
//Sorting //Sorting
for(int i=0; i<5; i++) do
{ {
for(int j=i+1; j<6; j++) swap = false;
{ for (int count = 0; count < last; count++)
if(array[j]>array[i]) {
{ if (array[count] > array[count + 1])
int temp=array[j]; {
array[j]=array[i]; int temp = array[count];
array[i]=temp; array[count] = array[count + 1];
} array[count + 1] = temp;
} swap = true;
} }
}
last--;
} while (swap);
//Output //Output
for(int i=0; i<6; i++) for(int i=0; i<6; i++)