jinesse

public class MergeSort { public static void main(String[] args) { // TODO Auto-generated method stub int[] A = {5, 2, 3, 6, 9, 1, 4, 5, 6}; int p = 0; int r = A.length-1; mergeSort(A,p,r);

/** * INSERTION-SORT(A) * for j = 2 to A.length * key = A[j] * //Insert A[j] into the sorted sequence A[1..j-1]. * i = j - 1 * while i>0 and A[i] > key * A[i+1] = A[i] * i = i-1

public class HeapSort { public static void main(String[] args) { // TODO Auto-generated method stub int[] A = {3,2,5,10,6,5}; // maxHeapify(A, 1); buildMaxHeap(A); for(int i : A){