Recursive Permutation Time Complexity

The permute method below is designed to generate all permutations of an integer array. What is the time complexity of this method?

public void permute(int[] arr, int start) {
    if(start == arr.length) {
        System.out.println(Arrays.toString(arr));
        return;
    }
    for(int i = start; i < arr.length; i++) {
        swap(arr, start, i);
        permute(arr, start + 1);
        swap(arr, start, i);
    }
}

Assume that the swap method correctly swaps two elements in the array.