Do you know what I did wrong?

public static void permute(String[] array, int start) {
    // loop is base case, permute as long as start < array length
    for (int i = start; i < array.length; i++) {
        // start is the currents permutations start index
        swap(array, start, i);
        // rekursion
        permute(array, start + 1);
        // reverse back
        swap(array, start, i);
    }

    // this point is reached after every index in the array but the result should be printed only if a result is found
    if (start == array.length - 1) {
        Arrays.stream(array).forEach(System.out::print);
        System.out.println();
    }
}

public static void swap(String[] array, int a, int b) {
    String temp = array[a];
    array[a] = array[b];
    array[b] = temp;
}

public static void main(String[] args) {
    String[] array = {"Sam", "I", "Am"};
    permute(array, 0);
}

Set<String> res = new LinkedHashSet<>();
String[] array = {"Sam", "I", "Am"};

for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
        if (i == j) continue;
        for (int k = 0; k < 3; k++) {
            if (k == i || k == j) continue;
            res.add(array[i] + array[j] + array[k]);
        }
    }
}
res.forEach(System.out::println);