[单选题]Why is the search process for binSearch() version A not balanced? 为什么说binSearch()版本A的查找过程并不平衡?z3d答案窝(daanwo.com)-大学生作业答案及考资分享平台
ABecause the left and right branches have different subvector sizes 因为向左、向右两个分支的子向量规模不同z3d答案窝(daanwo.com)-大学生作业答案及考资分享平台
BBecause the number of comparisons required for the left and right branches is not equal 因为向左、向右两个分支所需要的比较次数不相等z3d答案窝(daanwo.com)-大学生作业答案及考资分享平台
CBecause the Fibonacci search is more balanced than the binary search 因为Fibonacci查找比二分查找更平衡z3d答案窝(daanwo.com)-大学生作业答案及考资分享平台
DBecause the probability that the key is in the left subvector is greater than the probability that it is in the right 因为关键码位于左子向量中的概率比位于右侧的概率大