-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSelection.java
More file actions
52 lines (46 loc) · 1.44 KB
/
Copy pathSelection.java
File metadata and controls
52 lines (46 loc) · 1.44 KB
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
42
43
44
45
46
47
48
49
50
51
52
/*
* Sample usage: java Selection < tiny.txt
* Sample usage: java Selection < words3.txt
*/
public class Selection {
public static void sort(Comparable[] a){
// Sort a[] into increasing order.
int N = a.length; // array length
for (int i=0; i<N; i++){
// Exchange a[i] with smallest entry in a[i+1...N).
int min = i; // index of minimal entry
for (int j=i+1; j<N; j++){
if (less(a[j],a[min])) min = j;
}
exch(a, i, min);
}
}
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++)
StdOut.print(a[i] + " ");
StdOut.println();
}
public static boolean isSorted(Comparable[] a){
// Test whether the array entries are in order.
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){
// Read strings from standard input, sort them, and print.
String[] a = StdIn.readAllStrings();
sort(a);
assert isSorted(a);
show(a);
}
}