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 1.39
sub units 0.00
+
0

Catalan Triangle Row

Computes the row of the given order in Catalan's triangle.
Controller: CodeCogs

get GPL add to cart

Interface

C++

Catalan Triangle Row

 
std::vector<int>catalan_triangle_rowintn
boolfirst = true )
The recurrent formula used to generate Catalan's triangle is

The number found at C(i, i) represents the Catalan number of order i.

Example:

#include <codecogs/maths/combinatorics/sequences/catalan_triangle_row.h>
#include <iostream>
int main() {
  std::vector<int> row = Maths::Combinatorics::Sequences::catalan_triangle_row(6);
  std::cout << "Length of row: " << row.size() << std::endl;
  for (int i = 0; i < row.size(); i++)
    std::cout << row[i] << "  ";
  std::cout << std::endl;
  return 0;
}

Output:

Length of row: 7
1  6  20  48  90  132  132

References:

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

Parameters

firstDefault value = true

Returns

the row of order n in Catalan's triangle, as a standard C++ vector

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.