The combination of solving the sequence in DFS algorithm

/*

Pick 5 values from 13 books, what their combination might be,

The following code

DFS depth traversal, and full alignment is a method, but the thinking is different

*/

public class Main {
static int count = 0;
static int a[] = new INT[6];
public static void Main (string[] args) {
Boolean visit[] = new BOOLEAN[13];
DFS (a,visit,1);
System.out.println (count);
}

private static void Dfs (int[] A, boolean[] visit, int num) {
if (num==6) {
count++;
return;
}
for (a[num] = a[num-1]+1; A[num] < a[num]++) {//root permutation algorithm The difference is that this is not a[num]=1.
if (Visit[a[num]]==false) {
Visit[a[num]]=true;
num = num + 1;
DFS (A, visit, num);
num = num-1;
Visit[a[num]] = false;
}
}
}
}

The combination of solving the sequence in DFS algorithm