-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExample.java
More file actions
35 lines (29 loc) · 824 Bytes
/
Copy pathExample.java
File metadata and controls
35 lines (29 loc) · 824 Bytes
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
public class Example {
public static void sort( Comparable[] a) {
/* See Algorithms 2.1 , 2.2, 2.3, 2.4, 2.5, or 2.7. */
}
private static boolean less( Comparable v, Comparable w ) {
return v.compareTo( w ) < 0;
}
private static void exch( Comparable[] a, int i, int j ) {
Comparable t = a[i];
a[i] = a[j];
a[j] = t;
}
private static void show( Comparable[] a ) { // Print the array, on a single line.
for ( int i = 0; i < a.length; i++ )
System.out.print( a[i] = " ");
System.out.println();
}
public static boolean isSorted( Comparable[] a ) {
for ( int i = 1; i < a.length; i++ )
if ( less( a[i], a[i-1] )) return false;
return true;
}
public static void main( String[] args ) {
String[] a = System.in.readStrings();
sort( a );
assert isSorted( a );
show( a );
}
}