Java - Complejidad

static int[] sinRepetidos(int[] a) {

    int n = a.length;

    int[] c = new int[n];

    int k = 0;

    boolean b;

    for (int i = 0; i < n; i++) {

        b = true;

        int j=i+1;

        while (b && j < n) {

            if (a[i] == a[j]) {

                b = false;

            }

            j++;

        }

        if (b) {

            c[k] = a[i];

            k++;

        }

    }

    int[] d = new int[k];

    for (int h = 0; h < k; h++) {

        d[h] = c[h];

    }

    return d;

}