Computer scienceAlgorithms and Data StructuresAlgorithmsPrinciples and techniques

Divide and conquer

What does the method do?

Report a typo

Below you see a method implemented accordingly to the divide and conquer paradigm:

function f(array, left, right):
    if left == right then:
        if array[left] % 2 == 0 then:
            return 1
        else:
            return 0
    else:
        middle = (left + right) / 2
        return f(array, left, middle)
               + f(array, middle + 1, right)

What statements about this method are correct? Please note that the function f processes the array from the left index to the right index, including both endpoints.

Select one or more options from the list

After dividing, the element with the index middle belongs to the left sub-array.

The algorithm counts even numbers between indices left and right in the input array.

It finds the maximum even number between indices left and right in the input array.

It counts numbers between indices left and right in the input array.

___

Create a free account to access the full topic