Home /
Expert Answers /
Computer Science /
a-design-a-variant-34-binary-34-search-algorithm-which-splits-the-set-not-into-2-sets-of-equal-sizes-pa395
(Solved): (a) Design a variant "binary" search algorithm which splits the set not into 2 sets of equal sizes ( ...
(a) Design a variant "binary" search algorithm which splits the set not into 2 sets of equal
sizes (½ and ½), but into 2 sets of sizes one third (1/3) and two thirds (2/3).
(b) How does this algorithm compare with the original binary search in both the best case
and the worst case?
3. (25 points) (a) Design a variant "binary" search algorithm which splits the set not into 2 sets of equal sizes \( (1 / 2 \) and \( 1 / 2) \), but into 2 sets of sizes one third \( (1 / 3) \) and two thirds \( (2 / 3) \). (b) How does this algorithm compare with the original binary search in both the best case and the worst case?
Expert Answer
Answer : - (a) Design a variant "binary" search algorithm which splits the set not into 2 sets of equal sizes (½ and ½), but into 2 sets of sizes one