PROGRAM PENGURUTAN INSERTION SORT

class node{
        int data;
        node prev = null;
        node next = null;
        node(int data){
            this.data = data;
        }
    }


class sayembara{
    node head=null;
    node tail=null;

    void addback(int b){
        node baru = new node(b);
        if(head==null){
            head=baru;
            tail=baru;
        }else{
            baru.prev=tail;
            tail.next=baru;
            tail=baru;
        }
    }


public void insertionsort(){
  node temp=head;
  int n=0;
  for(node i=temp.next;i!=null;i=i.next){
   for(node j=i;j.prev!=null;j=j.prev){

    n=n+1;
    System.out.println("itarasi ke "+n);
    tampil();
    if(j.data<j.prev.data){
        int tmp;
        tmp=j.data;
        j.data=j.prev.data;
        j.prev.data=tmp;

    }
     }
   }
  }

void tampil(){
        node tmp=head;
        if(head==null){
            System.out.println("List Kosong");
        }else{
            while(tmp !=null){
                System.out.print(tmp.data +" ");
                tmp=tmp.next;
            }
        }System.out.println();
    }
public static void main (String [] args){
        sayembara x= new sayembara();

            x.addback(2);
        x.addback(6);
        x.addback(13);
        x.addback(19);
        x.addback(46);
        x.addback(35);
        x.tampil();

System.out.println("pengurutan dengan buble sort :");
        x.insertionsort();

}
}