An algorithm that cuts the work in half in each step is an ____ algorithm. A)O(log (n)) B)O(n log (n)) C)O(n²) D)O(n)

Question

Quizplus · Accepted Answer

An algorithm that cuts the work in half in each step is a binary search algorithm. Binary search has a time complexity of O(log (n)) which means the time required to execute the algorithm increases logarithmically with the input size, making it very efficient for large datasets.

An Algorithm That Cuts the Work in Half in Each