Permutations to arrange N persons around a circular table | C ++ code to demonstrate Circular Permutation ; Function to find no . of permutations ; Driver Code
#include <bits/stdc++.h> NEW_LINE using namespace std ; int Circular ( int n ) { int Result = 1 ; while ( n > 0 ) { Result = Result * n ; n -- ; } return Result ; } int main ( ) { int n = 4 ; cout << Circular ( n - 1 ) ; }