# Permutations to arrange N persons around a circular table

Given N, the number of persons. The task is to arrange N person around a circular table.**Examples**:

Input:N = 4Output:6Input:N = 5Output:24

**Approach:** It is the concept of **Circular permutation **i.e. there is no specific starting point in the arrangement, any element can be considered as the start of the arrangement. **For N = 4, Arrangements will be:**

Below is the formula to find Circular permutations:

Circular Permutations = (N - 1)!

Below is the impplementation of above idea:

## C++

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

## Java

`// Java code to demonstrate` `// Circular Permutation` `import` `java.io.*;` `class` `GFG` `{` `// Function to find no.` `// of permutations` `static` `int` `Circular(` `int` `n)` `{` ` ` `int` `Result = ` `1` `;` ` ` `while` `(n > ` `0` `)` ` ` `{` ` ` `Result = Result * n;` ` ` `n--;` ` ` `}` ` ` `return` `Result;` `}` `// Driver Code` `public` `static` `void` `main(String[] args)` `{` ` ` `int` `n = ` `4` `;` ` ` ` ` `System.out.println(Circular(n - ` `1` `));` `}` `}` `// This code is contributed` `// by Naman_Garg` |

## Python 3

`# Python 3 Program to demonstrate Circular Permutation ` `# Function to find no. of permutations` `def` `Circular(n) :` ` ` `Result ` `=` `1` ` ` `while` `n > ` `0` `:` ` ` `Result ` `=` `Result ` `*` `n` ` ` `n ` `-` `=` `1` ` ` `return` `Result` ` ` `# Driver Code` `if` `__name__ ` `=` `=` `"__main__"` `:` ` ` `n ` `=` `4` ` ` `# function calling` ` ` `print` `(Circular(n` `-` `1` `))` `# This code is contributed by ANKITRAI1` |

## C#

`// C# code to demonstrate` `// Circular Permutation` `using` `System;` ` ` `public` `class` `GFG {` `// Function to find no.` `// of permutations` `static` `int` `Circular(` `int` `n)` `{` ` ` ` ` `int` `Result = 1;` ` ` ` ` `while` `(n > 0)` ` ` `{` ` ` `Result = Result * n;` ` ` `n--;` ` ` `}` ` ` ` ` `return` `Result;` `}` ` ` `// Driver Code` `public` `static` `void` `Main()` `{` ` ` `int` `n = 4;` ` ` ` ` `Console.Write(Circular(n - 1));` `}` `}` ` ` `/* This Java code is contributed by 29AjayKumar*/` |

## PHP

`<?php` `// PHP code to demonstrate Circular Permutation` `// Function to find no. of permutations` `function` `Circular(` `$n` `)` `{` ` ` `$Result` `= 1;` ` ` `while` `(` `$n` `> 0)` ` ` `{` ` ` `$Result` `= ` `$Result` `* ` `$n` `;` ` ` `$n` `--;` ` ` `}` ` ` `return` `$Result` `;` `}` `// Driver Code` `$n` `= 4;` `echo` `Circular(` `$n` `- 1);` `// This code is contributed by mits` `?>` |

## Javascript

`<script>` `// javascript code to demonstrate` `// Circular Permutation` ` ` `// Function to find no.` ` ` `// of permutations` ` ` `function` `Circular(n)` ` ` `{` ` ` `var` `Result = 1;` ` ` `while` `(n > 0)` ` ` `{` ` ` `Result = Result * n;` ` ` `n--;` ` ` `}` ` ` `return` `Result;` ` ` `}` ` ` `// Driver Code` ` ` `var` `n = 4;` ` ` `document.write(Circular(n - 1));` `// This code is contributed by Rajput-Ji` `</script>` |

**Output:**

6

Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the **Essential Maths for CP Course** at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more, please refer **Complete Interview Preparation Course****.**