-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTestArraysSort.java
More file actions
38 lines (35 loc) · 1.08 KB
/
TestArraysSort.java
File metadata and controls
38 lines (35 loc) · 1.08 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
import java.util.*;
public class TestArraysSort {
static Random r = new Random();
static String
ssource = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
static char[] src =
ssource.toCharArray();
static String randString(int length) {
char[] buf = new char[length];
for(int i = 0; i < length; i++) {
int rnd = Math.abs(r.nextInt()) % src.length;
buf[i] = src[rnd];
}
return new String(buf);
}
static String[] randStrings(int length, int size) {
String[] s = new String[size];
for(int i = 0; i < size; i++)
s[i] = randString(length);
return s;
}
public static void print(String[] s) {
for(int i = 0; i < s.length; i++)
System.out.print(s[i] + " ");
System.out.println();
}
public static void main(String[] args) {
String[] s = randStrings(4, 10);
print(s);
Arrays.<String>sort(s);
print(s);
int loc = Arrays.<String>binarySearch(s, s[2]);
System.out.println("Location of " + s[2] + " is " + loc);
}
}