Program Selection Sort

import java.util.*;

class node {
int data;
node next,prev;
public node (int n) {
data = n;
next = prev = null;
}
}

class list {
node head,tail;
public list () {
head = tail = null;
}

void addLast(int n) {
node input = new node(n);
if(head==null) {
head = tail = input;
}
else {
tail.next = input;
input.prev = tail;
tail = input;
}
}

void urutkan() {
node satu = head;
while(satu!=tail && satu!=null) {
node dua = satu, jalan = satu.next;
while(jalan!=null){
if(jalan.data<dua.data)
dua = jalan;
jalan = jalan.next;
}
if(satu!=dua)
tukar(satu,dua);

satu = satu.next;
}
}

void tukar(node satu,node dua) {
int temp = dua.data;
dua.data = satu.data;
satu.data = temp;
}

void cetak () {
node temp = head;
while(temp!=null) {
System.out.print(temp.data+” “);
temp = temp.next;
}
}
}

public class SelectionSort {
public static void main (String[] args) {
Scanner input = new Scanner (System.in);
System.out.print(“Jumlah bilangan : “);
int n = input.nextInt();
list angka = new list();

System.out.println(“Masukkan bilangan :”);
for(int i=0;i<n;i++) {
System.out.print(“>> “);
int a = input.nextInt();
angka.addLast(a);
}

System.out.println(“Urutan bilangan dari kecil ke besar :”);
angka.urutkan();
angka.cetak();
System.out.println();
}
}