Develop an algorithm to find the largest palindrome in a given string using Python.
Not applicable
def find_largest_palindrome(string):
    palindrome = ''
    for i in range(len(string)):
        for j in range(i + 1, len(string)):
            substring = string[i:j + 1]
            if substring == substring[::-1] and len(substring) > len(palindrome):
                palindrome = substring

    return palindrome