Please tell me is this divide and conquer code or just recursion

Actually just I started to learn divide and conquer algorithms but I cant get is this divide and conquer or not.

def **divideAndConquer_Max**(arr, ind, len):
    maximum = -1
    if (ind >= len - 2):
        if (arr[ind] > arr[ind + 1]):
            print("if")
            return arr[ind]
        else:
            print("else")
            return arr[ind + 1]
     
    print(len,ind,arr)
    maximum = divideAndConquer_Max(arr, ind + 1, len)

    if (arr[ind] > maximum):
        return arr[ind];
    else:
        return maximum;

Hey, this code seems to be of a simple recursion, as the variable named ind is increasing by a constant factor every time.