Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class nomor1 {
- static void selectionsort(int [] arr){
- int i,j;
- for (i = 0; i < arr.length; i++) {
- int min = arr[i];
- int pos = i;
- for (j = i; j < arr.length; j++) {
- /* Cari nilai yang terkecil */
- if (arr[j] > min) {
- min = arr[j];
- pos = j;
- }
- }
- /* Tukar nilai terkecil ke arr[i] jika pos tdk sama i */
- if(i!=pos) {
- int temp = arr[i];
- arr[i] = arr[pos];
- arr[pos] = temp;
- }
- }
- }
- public static void main(String [] args){
- try{
- Scanner masukin = new Scanner(System.in);
- int [] fikri = new int[5];
- int y;
- for(y=0;y<5;y++){
- System.out.print("masukan nilai array ke-"+(y+1)+":");
- fikri[y] = masukin.nextInt();
- }selectionsort(fikri);
- for(y=0;y<5;y++){
- System.out.print(fikri[y]+" ");
- }
- }catch(Exception e){
- System.err.println(e);
- }System.out.println("\n==========================================================");
- int z;
- int [] Fikri = {41,484,573,130,487};
- for(int x=0;x<Fikri.length;x++){
- System.out.print(Fikri[x]+" ");
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement