How can I reduce the complexity of this code :
this code returns true if there are two elements in the array whose sum equals a number K

```
public static boolean methode(int c, int[] t) {
    for(int i = 0; i < t.length; i++)
        for(int j = 0; j < t.length; j++)
            if(j != i && t[i] + t[j] == c)
                return true;

    return false;
}

```