How to find array permutation using recursion

How to find all the possible permutation of array of size n using recursion

I know it can be done easily using still(next permutation) but I need ans using recursion

Assuming all numbers in array are distinct , it can be solved using backtracking.
Source Code.