Rosetta Code

Order by pair comparisons: Difference between revisions

Page Discussion

Order by pair comparisons (view source)

Revision as of 18:08, 4 June 2021

157 bytes removed ,  2 years ago
→‎Java: Binary search insertion sort
mNo edit summary
Line 416:
<lang java>import java.util.*;
 
public class OrderByPairSortComp1 {
public static void main(String[] args) {
List<String> items = Arrays.asList("violet", "red", "green", "indigo", "blue", "yellow", "orange");
List<String> sortedItems = new ArrayList<>();
Comparator<String> interactiveCompare = new Comparator<String>() {
 
// Use a binary insertion sort to order theint items.count = It should ask for0;
Scanner s = new Scanner(System.in);▼
// close to the minimum number of questions reqired
public int compare(String s1, String s2) {▼
System.out.printf("(%d) Is %s <, =, or > %s. Answer -1, 0, or 1: ", ++count, s1, s2);▼
return s.nextInt();▼
});▼
};▼
for (String item : items) {
System.out.printf("Inserting '%s' into %s\n", item, sortedItems);
int spotToInsert = Collections.binarySearch(sortedItems, item, new Comparator<String>(interactiveCompare) {;▼
// use binary search to find the insertion spot
▲ int spotToInsert = Collections.binarySearch(sortedItems, item, new Comparator<String>() {
int count = 0;
▲ Scanner s = new Scanner(System.in);
▲ public int compare(String s1, String s2) {
▲ System.out.printf("(%d) Is %s <, =, or > %s. Answer -1, 0, or 1: ", ++count, s1, s2);
▲ return s.nextInt();
▲ }
▲ });
// when item does not equal an element in sortedItems,
// it returns bitwise complement of insertion point
Line 448 ⟶ 445:
(1) Is violet <, =, or > red. Answer -1, 0, or 1: 1
Inserting 'green' into [red, violet]
(12) Is red <, =, or > green. Answer -1, 0, or 1: -1
(23) Is violet <, =, or > green. Answer -1, 0, or 1: 1
Inserting 'indigo' into [red, green, violet]
(14) Is green <, =, or > indigo. Answer -1, 0, or 1: -1
(25) Is violet <, =, or > indigo. Answer -1, 0, or 1: 1
Inserting 'blue' into [red, green, indigo, violet]
(16) Is green <, =, or > blue. Answer -1, 0, or 1: -1
(27) Is indigo <, =, or > blue. Answer -1, 0, or 1: 1
Inserting 'yellow' into [red, green, blue, indigo, violet]
(18) Is blue <, =, or > yellow. Answer -1, 0, or 1: 1
(29) Is red <, =, or > yellow. Answer -1, 0, or 1: -1
(310) Is green <, =, or > yellow. Answer -1, 0, or 1: 1
Inserting 'orange' into [red, yellow, green, blue, indigo, violet]
(111) Is green <, =, or > orange. Answer -1, 0, or 1: 1
(212) Is red <, =, or > orange. Answer -1, 0, or 1: -1
(313) Is yellow <, =, or > orange. Answer -1, 0, or 1: 1
[red, orange, yellow, green, blue, indigo, violet]
</pre>
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/311532"