I have forgotten

COST (GBP)
0.50
0.00
0

# pascal triangle row

viewed 5714 times and licensed 46 times
Returns the row of order \e n in Pascal's triangle.
Controller: CodeCogs

C++

## Pascal Triangle Row

 std::vectorpascal_triangle_row( int n )
This function generates the row of order n in a Pascal's triangle, based on the following recurrent formula

$C(n,k)&space;=&space;C(n-1,k-1)&space;+&space;C(n-1,k)$

where

$C(n,&space;0)&space;=&space;C(n,&space;n)&space;=&space;1,&space;\quad&space;\forall&space;n&space;\geq&space;0$

### Example 1

#include <codecogs/maths/combinatorics/sequences/pascal_triangle_row.h>
#include <iostream>
int main() {
std::vector<int> row = Maths::Combinatorics::Sequences::pascal_triangle_row(6);
std::cout << "Size 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:
Size of row: 7
1  6  15  20  15  6  1

### Parameters

 n the order of the row requested

### Returns

the row of order n in Pascal's triangle

### 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.