plz can any1 chk my program for errors
public class MinHeap{
private int size=100;
private int list[]=new int[size];
private int currentSize=0;
public boolean isFull(){
if(currentSize==size)
return true;
return false;
}
public boolean isEmpty(){
if(currentSize==0)
return true;
return false;
}
public void insert(int val){
int current,parent,temp;
if(isFull())
System.out.println("Heap is full");
else{
list[++currentSize]=val;
current=currentSize;
parent=current/2;
while(parent>0 && list[parent]>list[current]){
temp=list[current];
list[current]=list[parent];
list[parent]=temp;
current=parent;
parent=parent/2;
}
}
}
public void displayList(){
for(int i=1;i<=currentSize;i++){
System.out.println(list[i]);
}
}
public void heapSort(){
int i,temp,j,rchild,lchild;
i=currentSize;
while(i>0){
if(i==2&& list[2]<list[1])
break;
temp=list[1];
list[1]=list[i];
list[i]=temp;
i=i-1;
j=1;
while(j<i){
lchild=2*j;
rchild=2*j+1;
if(list[j]>list[lchild] && list[lchild]<list[rchild]&& lchild<i){
temp=list[j];
list[j]=list[lchild];
list[lchild]=temp;
j=lchild;
}
else {
if(list[j]>list[rchild] && list[rchild]<list[lchild]&& rchild<i){
temp=list[j];
list[j]=list[rchild];
list[rchild]=temp;
j=rchild;
}
else
break;
}
}
}
}
public static void main(String[] as){
MinHeap mylist=new MinHeap();
mylist.insert(23);
mylist.insert(67);
mylist.insert(93);
mylist.insert(5);
mylist.insert(78);
mylist.insert(96);
mylist.insert(47);
mylist.insert(22);
mylist.displayList();
mylist.heapSort();
System.out.println("After sorting");
mylist.displayList();
}
}
