▁previous ▁position ) ▁this ▁algorithm ▁can ▁be ▁viewed ▁as ▁a ▁simple / t rivial ▁example ▁of ▁dynamic ▁programming . ▁ ▁The ▁runtime ▁complexity ▁of ▁K ad ane ' s ▁algorithm ▁is ▁. ▁ ▁General izations ▁ ▁Similar ▁problems ▁may ▁be ▁pos ed ▁for ▁higher - dimensional ▁arrays , ▁but ▁their ▁solutions ▁are ▁more ▁complicated ; ▁see , ▁e . g ., ▁. ▁ ▁showed ▁how ▁to ▁find ▁the ▁k ▁largest ▁sub array ▁sums ▁in ▁a ▁one - dimensional ▁array , ▁in ▁the ▁optimal ▁time ▁bound ▁. ▁ ▁The ▁Max imum ▁sum ▁k - dis joint ▁sub array s ▁can ▁also ▁be ▁computed ▁in ▁the ▁optimal ▁time ▁bound ▁▁ ▁. ▁ ▁See ▁also ▁▁ ▁Sub set ▁sum ▁problem ▁ ▁Notes ▁ ▁References ▁ ▁. ▁ ▁. ▁ ▁. ▁ ▁External ▁links ▁▁▁▁▁▁▁▁ ▁www . algorithm ist . com ▁ ▁a lex e ig or . wik id ot . com ▁ ▁greatest ▁subsequ ential ▁sum ▁problem ▁on ▁Ros etta ▁Code ▁ ▁ge eks forge eks ▁page ▁on ▁K ad ane ' s ▁Algorithm ▁ ▁Category : Opt im ization ▁algorithms ▁and ▁methods ▁Category : Dynamic ▁programming ▁Category : Art icles ▁with ▁example ▁Python ▁code <0x0A> </s> ▁W LA X , ▁virtual ▁channel ▁ 2 5 ▁( U H F ▁digital ▁channel ▁ 1 7 ), ▁is ▁a ▁Fox - aff ili ated ▁television ▁station ▁lic ensed ▁to ▁La ▁C ros se , ▁Wisconsin , ▁United ▁States ▁and ▁serving ▁Western ▁Wisconsin . ▁The ▁station ▁is ▁owned ▁by ▁N ex star ▁Media ▁Group . ▁W LA