Sorting Algoritm in java
-------------------Bubble Sort-------------------- |
for (int i =bilangan.length-1; i>1; i--)
for (int j=0; j<i; j++)
if( bilangan[j] > bilangan[j+1] ) {
int temp =bilangan[j];
bilangan[j]=bilangan[j+1];
bilangan[j+1]=temp;
}
return bilangan;
}
klik aj gambarnya |
public int [] selectionShort(int bilangan[]){
int max,temp;
for(int i=bilangan.length-1;i>=0;i--){
max=0;
for(int j=0;j<=i;j++){
if(bilangan[max]<bilangan[j])
max=j;
}
temp=bilangan[max];
bilangan[max]=bilangan[i];
bilangan[i]=temp;
}
return bilangan;
}
------------------Insertion Sort-------------------- |
for (int i = 1; i < bilangan.length; i++){
int j = i;
int temp = bilangan[i];
while ((j > 0) && (bilangan[j-1] > temp)){
bilangan[j] = bilangan[j-1];
j--;
}
bilangan[j] = temp;
}
return bilangan;
}
Komentar
Posting Komentar