Test your Intermediate-level Data Structures Algorithms Sorting Searching Algorithms skills in Computer Science Fundamentals. This timed assessment evaluates your expertise in Information Technology.
Duration: 5 minutes
•40 questions
Time Remaining: 05:00
Progress: 0%
40 questions remaining
Question 1 of 40Assessment
When implementing binary search, why is the formula 'mid = low + (high - low) / 2' often preferred over 'mid = (low + high) / 2'?