Need a pseudocode for n queen problem (recursively) using this format:

Algorithm Insertion Sort(A): Input: An array A of n comparable elements Output: The array A with elements rearranged in non-decreasing order for i 1 to n - 1 do {Insert A[i] at its proper location in A[0],A(1),...,Ai 1]} cur + A[i] ji-1 while j> 0 and A[j] > cur do A[j+1] -- A[j] ;-;-1 A[i+1] -- cur {cur is now in the right place}