Reading the Complexity of Code

What is the complexity, in Big-O notation, of the following function?

def doublons(liste):
    for i in range(len(liste)):
        for j in range(len(liste)):
            if i != j and liste[i] == liste[j]:
                return True
    return False