Skip to content

Algorithm for Pascal Triangle #110

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
duaraghav8 merged 1 commit into from
May 29, 2016
Merged

Algorithm for Pascal Triangle #110

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion algorithm/category.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -83,7 +83,8 @@
"etc": {
"name": "Uncategorized",
"list": {
"flood_fill": "Flood Fill"
"flood_fill": "Flood Fill",
"pascal_triangle": "Pascal's Trangle"
}
}
}
17 changes: 17 additions & 0 deletions algorithm/etc/pascal_triangle/desc.json
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
{
"Pascal's Triangle": " Pascal's triangle is a triangular array of the binomial coefficients.",
"Applications": [
"Binomial Expansion",
"Probability"
],
"Complexity": {
"time": " O(N<sup>2</sup>)",
"space": "O(N<sup>2</sup>)"
},
"References": [
"<a href='https://en.wikipedia.org/wiki/Pascal%27s_triangle'>Wikipedia</a>"
],
"files": {
"pascal_triangle": "Pascal's Triangle"
}
}
20 changes: 20 additions & 0 deletions algorithm/etc/pascal_triangle/pascal_triangle/code.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
for ( var i = 0; i < N; i++ ) {
for ( var j = 0; j <= i; j++ ) {
if( j === i || j === 0 ) { // First and last values in every row are 1
A[i][j] = 1;

tracer._notify( i, j, A[i][j])._wait();
tracer._denotify( i, j);
} else { // Other values are sum of values just above and left of above
tracer._select( i-1, j-1)._wait();
tracer._select( i-1, j)._wait();

A[i][j] = A[i-1][j-1] + A[i-1][j];

tracer._notify( i, j, A[i][j])._wait();
tracer._denotify( i, j);
tracer._deselect( i-1, j-1);
tracer._deselect( i-1, j);
}
}
}
13 changes: 13 additions & 0 deletions algorithm/etc/pascal_triangle/pascal_triangle/data.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
var N = 9;
var A = new Array (N);
for (var i = N - 1; i >= 0; i--) {
A[i] = new Array (N);
}

for (var i = N - 1; i >= 0; i--) {
for (var j = N - 1; j >= 0; j--) {
A[i][j] = ' ';
}
}

var tracer = new Array2DTracer ('Pascal\'s Triangle')._setData(A);