How can I improve complexity on this function?

Question

import unittest
import math


def find(f, y, a, b):
    for n in range(int(a),int(b+1)):
        if f(n) == y:
            return n
    else:
        return -1


class T