public static void heapTree(int array[], int len){
    boolean heap;
    
    for (int i =((len-1)/2); i>0; i--){
            int k=i;
            int v= array[k];
            heap = false;
            
        while ((!heap)&&(2*k)<len-1){
           int j=2*k;
               if(j<len-1){
                    if(array[j]<array[j+1])
                         j=j+1;
                        if(v>=array[j])
                            heap=true;    
                        else{
                            array[k] = array[j];
                            k=j;
                    }
                
                } array[k] = v;
       
        }     
         System.out.print(" || ");
        for(int x = 0; x < array.length; x++) {
                System.out.print(" || " + array[x] + " ");
            }
            System.out.println();
        }
    } 

public static void heapTree(int array[], int len){
    int i, o;
   int lChild, rChild, mChild, root, temp;
   root = (len-1)/2;
 
  for(o = root; o >= 0; o--){
   for(i=root;i>=0;i--){
   lChild = (2*i)+1;
   rChild = (2*i)+2;
   if((lChild <= len) && (rChild <= len)){
   if(array[rChild] >= array[lChild])
   mChild = rChild;
   else
   mChild = lChild;
   }
   else{
   if(rChild > len)
   mChild = lChild;
   else
   mChild = rChild;
   }
   
   System.out.print(" || Pass " + o + "-->  ");
            for(int x = 0; x < array.length; x++) {
                System.out.print(array[x] + " ");
            }
            System.out.println();
   }
  }
}

macosxnerd101, on 26 July 2011 - 12:02 PM, said:

class Person{
    private String name; //<-- name is an instance field
}

public Student(String nm, int t1, int t2, int t3) {
    String Name = nm ;
    int Test1 = s.Test1() ;
    int Test2 = s.Test2() ;
    int Test3 = s.Test3();