What is the name given to the algorithm depicted in the pseudo code below?

[answerhappygod]

procedure generate(n : integer, Arr : array):
if n = 1 then
output(Arr)
else
for i = 0; i <= n - 2; i ++ do
generate(n - 1, Arr)
if n is even then
swap(Arr, Arr[n-1])
else
swap(Arr[0], Arr[n-1])
end if
end for
generate(n - 1, Arr )
end if
a) bubble sort
b) heap sort
c) heap’s algorithm
d) prim’s algorithm