-
Notifications
You must be signed in to change notification settings - Fork 0
/
Insertion.java
41 lines (36 loc) · 1011 Bytes
/
Insertion.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
public class Insertion
{
public static void sort(Comparable[] a)
{
for (int i = 1; i < a.length; i++)
{
for (int j = i; j > 0 && less(a[j], a[j-1]); j--)
{
exch(a, j, j-1);
}
}
}
private static void exch(Comparable[] a, int i, int j)
{ Comparable temp = a[i]; a[i] = a[j]; a[j] = temp; }
private static boolean less(Comparable v, Comparable w) { return v.compareTo(w) < 0; }
private static boolean isSorted(Comparable[] a)
{
for (int i = 1; i < a.length; i++)
{
if (less(i, i-1)) { return false; }
}
return true;
}
private static void printArray(Comparable[] a){
for (int i = 0; i < a.length; i++)
{ StdOut.print(a[i] + " "); }
StdOut.println();
}
public static void main(String[] args)
{
String[] a = StdIn.readAllStrings();
sort(a);
assert isSorted(a);
printArray(a);
}
}