Commit b95d156

committed

used brute force to find max and min sum in subarray of size k

1 parent 19c559c commit b95d156Copy full SHA for b95d156

File tree

+27

-2

lines changed

+27

-2

lines changed

Lines changed: 27 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@ using namespace std;`
`5`	`5`
`6`	`6`	`//program to find maximum subarray sum whose size equals k`
`7`	`7`
`8`		`-int maxSum(int arr[],int size,int k,int i=0)`
	`8`	`+int maxSum(int arr[],int size,int k)`
`9`	`9`	`{`
`10`	`10`	`int Max = 0,curMax;`
`11`	`11`	`for(int i = 0 ; i <= (size-k) ; i++)`
`@@ -25,9 +25,34 @@ int maxSum(int arr[],int size,int k,int i=0)`
`25`	`25`	`return Max;`
`26`	`26`	`}`
`27`	`27`
	`28`	`+int minSum(int arr[],int size,int k)`
	`29`	`+{`
	`30`	`+ int Min = INT_MAX,curMin;`
	`31`	`+ for(int i = 0 ; i <= (size-k) ; i++)`
	`32`	`+ {`
	`33`	`+`
	`34`	`+ curMin = 0;`
	`35`	`+ for(int j = i ; j < i+k ; j++)`
	`36`	`+ {`
	`37`	`+ curMin += arr[j];`
	`38`	`+`
	`39`	`+ if(curMin < Min)`
	`40`	`+ Min = curMin;`
	`41`	`+ }`
	`42`	`+`
	`43`	`+ }`
	`44`	`+`
	`45`	`+ return Min;`
	`46`	`+}`
	`47`	`+`
`28`	`48`
`29`	`49`	`int main()`
`30`	`50`	`{`
`31`		`- int arr[] =`
	`51`	`+ int arr[] = {3,4,6,7,-10};`
	`52`	`+ int size = sizeof(arr)/sizeof(arr[0]);`
	`53`	`+ cout<<maxSum(arr,size,2);`
	`54`	`+`
	`55`	`+ cout<<endl<<minSum(arr,size,2);`
	`56`	`+`
`32`	`57`	`return 0;`
`33`	`58`	`}`

Comments

(0)