Recursion and backtracking in C#

public void Backtrack(int[] nums, List<int> path, List<List<int>> result) {
    if (path.Count == nums.Length) {
        result.Add(new List<int>(path));
        return;
    }

    for (int i = 0; i < nums.Length; i++) {
        if (path.Contains(nums[i])) continue;
        path.Add(nums[i]);
        Backtrack(nums, path, result);
        path.RemoveAt(path.Count - 1);
    }
}