thegodfather's blog

Help regarding knuth optimization.
By thegodfather, history, 9 years ago, In English

As part of this quora post(http://www.quora.com/What-is-Knuths-optimization-in-dynamic-programming) a description of knuth optimization has been given. It has been mentioned that :- it can be proven that mid[l,r-1] <= mid[l,r] <= mid[l+1,r] — this means monotonicity of mid by l and r. Can anyone of you please help me regarding how to prove it?

  • Vote: I like it
  • +5
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by thegodfather (previous revision, new revision, compare).

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by thegodfather (previous revision, new revision, compare).

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I know there are many awesome people in this community..please help!

→ Reply