Qual a complexidade temporal do método allDiff no pior caso? //

/**
     *
     * @param numbers : an array that is filled up to position n-1 
     * @return true iff all the numbers are different
     */
    public static boolean allDiff(int[] numbers,int n) {
        int i=0;
        while (i<n && diff(numbers[i],numbers,i,n))
            i++;
        return i==n;
    }
    private static boolean diff(int number, int[] numbers, int pos, int n) {
        int i=pos+1;
        while (i<n && number!=numbers[i])
            i++;
        return i==n;
    }