Advertisement
Guest User

Untitled

a guest
Nov 15th, 2018
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 4.80 KB | None | 0 0
  1. import java.util.*;
  2.  
  3.  
  4. public class TestHeap {
  5.  
  6.     public static void main(String[] args) throws Exception {
  7.         int[] seq = new int[] {48, 47, 1, 25, 40, 17, 3, 54, 8, 37, 30, 30, 65, 28, 46,11};
  8.  
  9.         /*System.out.println("-----MAX HEAP-----");
  10.         testHeap(new Delivery().new MaxHeap(seq.clone()));
  11.         System.out.println("----------");
  12.         System.out.println("-----MIN HEAP-----");
  13.         testHeap(new Delivery().new MinHeap(seq.clone()));*/
  14.  
  15.  
  16.  
  17.         /*Heap h2 = new Delivery().new MaxHeap(seq);
  18.         System.out.println(Arrays.toString(h2.elements));
  19.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  20.         System.out.println("add : 83");
  21.         h2.add(83);
  22.         System.out.println(Arrays.toString(h2.elements));
  23.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  24.         System.out.println("remove : ");
  25.         h2.remove();
  26.         System.out.println(Arrays.toString(h2.elements));
  27.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  28.         System.out.println("remove : ");
  29.         h2.remove();
  30.         System.out.println(Arrays.toString(h2.elements));
  31.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  32.         System.out.println("add : 67");
  33.         h2.add(67);
  34.         System.out.println(Arrays.toString(h2.elements));
  35.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  36.         System.out.println(h2.elements[2]);*/
  37.  
  38.  
  39.         // 29, 44, 27, 48, 30, 15, 46, 36, 55, 14, 33, 24, 38, 20, 2
  40.         /*System.out.println(Arrays.toString(h2.elements));
  41.         h2.add(87);
  42.         System.out.println(Arrays.toString(h2.elements));
  43.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  44.         System.out.println(Arrays.toString(h2.elements));
  45.         h2.remove();
  46.         h2.remove();
  47.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  48.         System.out.println(Arrays.toString(h2.elements));
  49.         System.out.println(h2.elements[0]);
  50.         h2.add(107);
  51.         System.out.println(h2.elements[1]);
  52.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  53.         System.out.println(Arrays.toString(h2.elements));
  54.         System.out.println(Arrays.toString(h2.elements));*/
  55.  
  56.  
  57.         /*System.out.println("adding -7");
  58.         h2.add(-7);
  59.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  60.         System.out.println(Arrays.toString(h2.elements));
  61.         h2.remove();
  62.         h2.remove();
  63.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  64.         System.out.println(Arrays.toString(h2.elements));
  65.         h2.add(-29);
  66.         System.out.println("end : "+h2.end+" elements.length : "+h2.elements.length);
  67.         System.out.println(Arrays.toString(h2.elements));
  68.         System.out.println(h2.elements[0]);
  69.         h2.sort();
  70.         System.out.println(h2.elements[0]);
  71.         int[] sorted = h2.sort();
  72.         List<int[]> steps = h2.getSteps();
  73.         System.out.println("Steps:");
  74.         for (int[] step: steps){
  75.             System.out.println(Arrays.toString(step));
  76.         }
  77.         */
  78.         Heap h2 = new Delivery().new MaxHeap(seq);
  79.         h2.add(74);
  80.         h2.remove();
  81.         h2.remove();
  82.         h2.add(99);
  83.         System.out.println(h2.elements[2]); // want 54
  84.         int[] sorted = h2.sort();
  85.         List<int[]> steps = h2.getSteps();
  86.         System.out.println("Steps:");
  87.         for (int[] step: steps){
  88.             System.out.println(Arrays.toString(step));
  89.         }
  90.  
  91.  
  92.  
  93.  
  94.  
  95.     }
  96.    
  97.     private static void testHeap(Heap h){
  98.         int[] sorted = h.sort();
  99.         List<int[]> steps = h.getSteps();
  100.         System.out.println("Steps:");
  101.         for (int[] step: steps){
  102.             System.out.println(Arrays.toString(step));
  103.         }
  104.         System.out.println("Sorted: "+Arrays.toString(sorted));
  105.     }
  106. }
  107.  
  108. /*
  109. 54
  110. Steps:
  111. [65, 54, 48, 47, 40, 30, 46, 25, 8, 37, 30, 1, 17, 28, 3, 11]
  112. [74, 65, 48, 54, 40, 30, 46, 47, 8, 37, 30, 1, 17, 28, 3, 11, 25]
  113. [65, 54, 48, 47, 40, 30, 46, 25, 8, 37, 30, 1, 17, 28, 3, 11, 74]
  114. [54, 47, 48, 25, 40, 30, 46, 11, 8, 37, 30, 1, 17, 28, 3, 65, 74]
  115. [99, 65, 54, 47, 40, 30, 48, 25, 8, 37, 30, 1, 17, 28, 46, 11, 74]
  116. [65, 47, 54, 25, 40, 30, 48, 11, 8, 37, 30, 1, 17, 28, 46, 99, 74]
  117. [54, 47, 48, 25, 40, 30, 46, 11, 8, 37, 30, 1, 17, 28, 65, 99, 74]
  118. [48, 47, 46, 25, 40, 30, 28, 11, 8, 37, 30, 1, 17, 54, 65, 99, 74]
  119. [47, 40, 46, 25, 37, 30, 28, 11, 8, 17, 30, 1, 48, 54, 65, 99, 74]
  120. [46, 40, 30, 25, 37, 1, 28, 11, 8, 17, 30, 47, 48, 54, 65, 99, 74]
  121. [40, 37, 30, 25, 30, 1, 28, 11, 8, 17, 46, 47, 48, 54, 65, 99, 74]
  122. [37, 30, 30, 25, 17, 1, 28, 11, 8, 40, 46, 47, 48, 54, 65, 99, 74]
  123. [30, 25, 30, 11, 17, 1, 28, 8, 37, 40, 46, 47, 48, 54, 65, 99, 74]
  124. [30, 25, 28, 11, 17, 1, 8, 30, 37, 40, 46, 47, 48, 54, 65, 99, 74]
  125. [28, 25, 8, 11, 17, 1, 30, 30, 37, 40, 46, 47, 48, 54, 65, 99, 74]
  126. [25, 17, 8, 11, 1, 28, 30, 30, 37, 40, 46, 47, 48, 54, 65, 99, 74]
  127. [17, 11, 8, 1, 25, 28, 30, 30, 37, 40, 46, 47, 48, 54, 65, 99, 74]
  128. [11, 1, 8, 17, 25, 28, 30, 30, 37, 40, 46, 47, 48, 54, 65, 99, 74]
  129. [8, 1, 11, 17, 25, 28, 30, 30, 37, 40, 46, 47, 48, 54, 65, 99, 74]
  130. */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement