Pascal's triangle is a triangular array of the binomial coefficients in a triangle. Read more about Pascal's triangle here.
The gif image below is from Wikipedia that demonstrates the formation of Pascal's triangle clearly.
Here is a recursive algorithm to find out the number at any given position.
function element_at(row, position)
If position = 0 OR position == row
return element_at(row - 1, position - 1) + element_at(row - 1, position)
The C program
The github repo - here
By the way, did you notice the elegance of the recursion? The code is almost same as the algorithm. Recursion makes code readable, concise and brilliant..!