001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
// Exercise 2.2.2 (Solution published at http://algs4.cs.princeton.edu/)
package algs24;
import stdlib.*;
import java.awt.Font;
/* ***********************************************************************
 *  Compilation:  javac TraceMerge.java
 *  Execution:    java  TraceMerge input
 *
 *  Mergesort the sequence of strings specified as the command-line
 *  arguments and show the detailed trace.
 *
 *  % java TraceMerge MERGESORTEXAMPLE
 *
 *************************************************************************/

public class XTraceHeap {
  private static int line = 0;

  public static void sort(String[] pq) {
    int N = pq.length;
    for (int k = N/2; k >= 1; k--) {
      sink(pq, k, N);
      draw (pq, N, k); line++;
    }
    while (N > 1) {
      exch(pq, 1, N--);
      sink(pq, 1, N);
      draw (pq, N, 1); line++;
    }
  }

  /* *********************************************************************
   * Helper functions to restore the heap invariant.
   **********************************************************************/

  private static void sink(String[] pq, int k, int N) {
    while (2*k <= N) {
      int j = 2*k;
      if (j < N && less(pq, j, j+1)) j++;
      if (!less(pq, k, j)) break;
      exch(pq, k, j);
      k = j;
    }
  }

  /* *********************************************************************
   * Helper functions for comparisons and swaps.
   * Indices are "off-by-one" to support 1-based indexing.
   **********************************************************************/
  private static boolean less(String[] pq, int i, int j) {
    return pq[i-1].compareTo(pq[j-1]) < 0;
  }

  private static void exch(String[] pq, int i, int j) {
    String swap = pq[i-1];
    pq[i-1] = pq[j-1];
    pq[j-1] = swap;
  }

  // is v < w ?
  private static boolean less(String v, String w) {
    return (v.compareTo(w) < 0);
  }


  // draw the contents of the array
  private static void draw(String[] a, int N, int k) {
    StdDraw.setPenColor(StdDraw.BLACK);
    StdDraw.text(-2.50, line, N  + "");
    StdDraw.text(-1.25, line, k + "");
    for (int i = 0; i < a.length; i++) {
      StdDraw.text(i, line, a[i]);
    }
  }

  // display header
  private static void header(String[] a) {
    int N = a.length;
    StdDraw.setPenColor(StdDraw.BLACK);
    StdDraw.text(N/2, -3, "a[ ]");
    for (int i = 0; i < N; i++)
      StdDraw.text(i, -2, i + "");
    StdDraw.text(-2.50, -2, "N");
    StdDraw.text(-1.25, -2, "k");
    StdDraw.setPenColor(StdDraw.BOOK_RED);
    StdDraw.line(-4, -1.65, N-.5, -1.65);
    StdDraw.setPenColor(StdDraw.BLACK);
    for (int i = 0; i < a.length; i++)
      StdDraw.text(i, -1, a[i]);
  }

  // display footer
  private static void footer(String[] a) {
    int N = a.length;
    StdDraw.setPenColor(StdDraw.BLACK);
    for (int i = 0; i < a.length; i++)
      StdDraw.text(i, line, a[i]);
  }


  // test client
  public static void main(String[] args) {
    args = new String[] { "SORTEXAMPLE" };

    // parse command-line argument as an array of 1-character strings
    String s = args[0];
    int N = s.length();
    String[] a = new String[N];
    for (int i = 0; i < N; i++)
      a[i] = s.substring(i, i+1);

    // set canvas size
    StdDraw.setCanvasSize(30*(N+3), (int) (30*(1.5*N+3)));
    StdDraw.setXscale(-4, N+1);
    StdDraw.setYscale(1.5*N+1, -4);
    StdDraw.setFont(new Font("SansSerif", Font.PLAIN, 13));

    // display the header
    header(a);

    // sort the array and display trace
    sort(a);

    // display the footer
    footer(a);
  }

}