2015-09-07 11:44:36 -06:00
|
|
|
// arrays/AlphabeticSearch.java
|
2015-12-15 11:47:04 -08:00
|
|
|
// (c)2016 MindView LLC: see Copyright.txt
|
2015-11-15 15:51:35 -08:00
|
|
|
// We make no guarantees that this code is fit for any purpose.
|
|
|
|
// Visit http://mindviewinc.com/Books/OnJava/ for more book information.
|
2016-01-25 18:05:55 -08:00
|
|
|
// Searching with a Comparator
|
2015-06-15 17:47:35 -07:00
|
|
|
import java.util.*;
|
2015-11-11 20:20:04 -08:00
|
|
|
import onjava.*;
|
2016-01-25 18:05:55 -08:00
|
|
|
import static onjava.ArrayShow.*;
|
2015-06-15 17:47:35 -07:00
|
|
|
|
|
|
|
public class AlphabeticSearch {
|
|
|
|
public static void main(String[] args) {
|
2016-01-25 18:05:55 -08:00
|
|
|
String[] sa = new Rand.String().array(30);
|
2015-06-15 17:47:35 -07:00
|
|
|
Arrays.sort(sa, String.CASE_INSENSITIVE_ORDER);
|
2016-01-25 18:05:55 -08:00
|
|
|
show(sa);
|
2015-06-15 17:47:35 -07:00
|
|
|
int index = Arrays.binarySearch(sa, sa[10],
|
|
|
|
String.CASE_INSENSITIVE_ORDER);
|
2016-01-25 18:05:55 -08:00
|
|
|
System.out.println(
|
|
|
|
"Index: "+ index + "\n"+ sa[index]);
|
2015-06-15 17:47:35 -07:00
|
|
|
}
|
2015-09-07 11:44:36 -06:00
|
|
|
}
|
|
|
|
/* Output:
|
2016-07-22 14:45:35 -06:00
|
|
|
[anmkkyh, bhmupju, btpenpc, cjwzmmr, cuxszgv, eloztdv,
|
|
|
|
ewcippc, ezdeklu, fcjpthl, fqmlgsh, gmeinne, hyoubzl,
|
|
|
|
jbvlgwc, jlxpqds, ljlbynx, mvducuj, qgekgly, skddcat,
|
|
|
|
taprwxz, uybypgp, vjsszkn, vniyapk, vqqakbm, vwodhcf,
|
|
|
|
ydpulcq, ygpoalk, yskvett, zehpfmm, zofmmvm, zrxmclh]
|
2015-06-15 17:47:35 -07:00
|
|
|
Index: 10
|
2016-07-22 14:45:35 -06:00
|
|
|
gmeinne
|
2015-09-07 11:44:36 -06:00
|
|
|
*/
|