1- Show the output of the code. 2- Which method will you use to sort the elements in list, list1 and collection c1, c2, and c3. Add the actual sort methods to the above code and show the actual result. 3- Which method will you use to do a binary search the elements in list, list1 and collection c1, c2, and c3. Add the actual binary search methods to the above code and show the actual result
Consider the code in page 560 question 7.3 which is listed below:
import java.util.*;
public class TestArrayAndLinkedList {
public static void main(String[] args) {
List<String> list = Arrays.asList("yellow", "red", "green","blue");
Collections.reverse(list);
System.out.println("A list of integers in the array list:");
System.out.println(list);
List<String> list1 = Arrays.asList("yellow", "red", "green","blue");
List<String> list2 = Arrays.asList("white","black");
Collections.copy(list1,list2);
System.out.println(list1);
Collection<String> c1=Arrays.asList("red","cyan");
Collection<String> c2=Arrays.asList("red","blue");
Collection<String> c3=Arrays.asList("pink","tan");
System.out.println(Collections.disjoint(c1,c2));
System.out.println(Collections.disjoint(c1,c3));
Collection<String> collection=Arrays.asList("red","cyan","red");
System.out.println(Collections.frequency(collection,"red"));
}
}
1- Show the output of the code.
2- Which method will you use to sort the elements in list, list1 and collection c1, c2, and c3. Add the actual sort methods to the above code and show the actual result.
3- Which method will you use to do a binary search the elements in list, list1 and collection c1, c2, and c3. Add the actual binary search methods to the above code and show the actual result.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
