CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 4 of 4

Threaded View

  1. May 2nd, 2014, 02:42 PM #4
    zizz
    zizz is offline Banned
    Join Date
    Aug 2013
    Posts
    55

    Re: Pascal Triangle Problem - Please help

    Quote Originally Posted by BlueBir86 View Post
    (c) Use dynamic programming to design an O(n2) time algorithm that computes the first n rows in Pascal’s triangle. Does the dynamic programming algorithm performs better than the recursive
    algorithm? Explain.
    Being presented with the question it strikes me that,

    recursion + memoization == dynamic programming

    Remember you read it here first
    Last edited by zizz; May 2nd, 2014 at 04:29 PM.
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Tags for this Thread

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Forum Rules




Click Here to Expand Forum to Full Width

Featured