Answer:
The answer is "binary search= 5.111 and Linear seacrch= 6400".
Explanation:
Following are the description of this question:
- Binary Search-The performance with single arrays is log 10000 = 4, through the use of two arrays (60/100)*log4000 + (40/100)*(log4000 + log6000) = 5.111.
- In the linear search: while doing static searches, 10000 would be performed, and (60/100)*4000 + (40/100)*6000 = 6400 will be used with two arrays.
- It's a special case, that will be used in one of the arrays in a binary search. Whereas good case uses linear frames, two frames are used, as indicated above.
Answer:
i think its accommodate, because the other two dont look right. correct me if im wrong
Inter personal. As she needs to work with persons, them being her co workers
new ArrayList<>()
ArrayList<data_type> list_name = new ArrayList<>(); The following statement, for instance, can be used to build a generic ArrayList of type String.
ArrayList<String> arraylist = new ArrayList<>(); This will produce a String-type empty ArrayList with the name "arraylist."
Learn more here:
brainly.com/question/16464645
#SPJ4
