Derangements_List

A derangement of n objects is a permutation with no fixed points. If we symbolize the permutation by , then for a derangment, is never equal to .

Returns

Example:

#include <codecogs/maths/combinatorics/sequences/derangements_list.h>
#include <iostream>
int main() {
  std::vector<int> result = Maths::Combinatorics::Sequences::derangements_list(10);
  std::cout << "For 0 through 10 objects, the number of derangements are:";
  std::cout << std::endl;
  for (int i = 0; i < result.size(); i++)
    std::cout << result[i] << "  ";
  std::cout << std::endl;
  return 0;
}

Output:

For 0 through 10 objects, the number of derangements are:
1  0  1  2  9  44  265  1854  14833  133496  1334961

References

SUBSET, a C++ library of combinatorial routines, http://www.csit.fsu.edu/~burkardt/cpp_src/subset/subset.html