Commit dd9381f

committed

Fix boundary condition

1 parent 4d56693 commit dd9381fCopy full SHA for dd9381f

File tree

+11

-1

lines changed

+11

-1

lines changed

Lines changed: 11 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,6 +4,11 @@ using namespace std;`
`4`	`4`
`5`	`5`	`int cost[N][N], obst[N][N], prefix[N];`
`6`	`6`
	`7`	`+/*`
	`8`	`+ * function to find optimal binary search tree (with minimum cost)`
	`9`	`+ * time complexity : O(n^3)`
	`10`	`+ * space complexity : O(n^2)`
	`11`	`+ */`
`7`	`12`	`void findOptimalBST(int keys[], int freq[], int n) {`
`8`	`13`	`int i,j,l,r;`
`9`	`14`	`/precompute prefix sums/`
`@@ -21,7 +26,7 @@ void findOptimalBST(int keys[], int freq[], int n) {`
`21`	`26`	`obst[i][i] = i;`
`22`	`27`	`}`
`23`	`28`	`for(l=2; l<=n; l++) {`
`24`		`- for(i=0; i<=n-l+1; i++) {`
	`29`	`+ for(i=0; i<n-l+1; i++) {`
`25`	`30`	`j = i+l-1;`
`26`	`31`	`cost[i][j] = INT_MAX;`
`27`	`32`	`/Calculate cost for each element in [i,j] as the root and take the minimum/`
`@@ -36,6 +41,11 @@ void findOptimalBST(int keys[], int freq[], int n) {`
`36`	`41`	`}`
`37`	`42`	`}`
`38`	`43`	`}`
	`44`	`+ for(i=0;i<n;i++) {`
	`45`	`+ for(j=0;j<n;j++)`
	`46`	`+ cout<<cost[i][j]<<" ";`
	`47`	`+ cout<<endl;`
	`48`	`+ }`
`39`	`49`	`}`
`40`	`50`
`41`	`51`	`int main() {`

Comments

(0)