Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- for i<-0 to n
- for j<-0 to min(i,k)
- if(j == 0 || j == i)
- B[i][j] = 1
- else
- B[i][j] = B[i-1][j-1] + B[i-1][j]
- return B[n][k]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
