<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">package sort;

public class InsertionSort&lt;T extends Comparable&lt;T&gt;&gt; implements Sorter&lt;T&gt; {

   public void sort(T[] x) {

      // scan through all elements
      for (int i = 1; i &lt; x.length; i++) {
         // invariant is: x[0],...,x[i-1] are sorted
         // now find rightful position for x[i]
         T tmp = x[i];
         int j;
         // move x[i] into sorted portion
         for (j = i; j &gt; 0 &amp;&amp; x[j-1].compareTo(tmp) &gt; 0; j--) x[j] = x[j-1];
         x[j] = tmp;
      }
   }
}
</pre></body></html>