I have forgotten
my Password

Or login with:

  • Facebookhttp://facebook.com/
  • Googlehttps://www.google.com/accounts/o8/id
  • Yahoohttps://me.yahoo.com
get GPL
COST (GBP)
this unit 0.70
sub units 0.19
+
0

Cycles

Counts the number of cycles in a permutation.
Controller: CodeCogs

get GPL add to cart

Dependents

Info

Interface

C++
HTML

Cycles

 
intcyclesintn
int*p )
Consider the permutation

A <em> cycle </em> is a sequence of indices i_1, i_2, \ldots, i_k such that

and

This function calculates the number of cycles in a given permutation, using an efficient algorithm.

Example:

#include <codecogs/maths/combinatorics/permutations/cycles.h>
#include <iostream>
int main()
{
  int beta[9] = {2, 3, 9, 6, 7, 8, 5, 4, 1};
  std::cout << "The number of cycles of the Beta permutation: ";
  std::cout << Maths::Combinatorics::Permutations::cycles(9, beta);
  std::cout << std::endl;
  return 0;
}

Output:

The number of cycles of the Beta permutation: 3

References:

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

Parameters

nthe size of the permutation
pthe actual permutation stored as an array

Returns

the number of cycles found in the permutation

Authors

Lucian Bentea (August 2005)
Source Code

Source code is available when you agree to a GP Licence or buy a Commercial Licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.