@ Dave : can u pls explain the solution u gave .
How can u say fibnocci sequence produces worst case ?
On Fri, Nov 16, 2012 at 11:15 AM, Shruti Gupta wrote:
> Don, thanks for the solution, Can u pls explain how a+b gets reduced by
> atleast 25%
>
>
> On Fri, Nov 16, 2012 at 3:42 AM, Don wrote:
>
http://theory.cs.uiuc.edu/~jeffe/pubs/pdf/arith.pdf
On Fri, Nov 16, 2012 at 8:55 PM, rajesh pandey wrote:
> I think its the stricter version of LIS , where when you see for the
> increasing number , just see the number which is greater with the number k
> than the previous one.
>
> Thanks ,
>
from each node , make 4 recursive call
1) you consider this node as part of the solution i.e left=target -
currentNode->data is passed , and consider current->left for next
recursion
2)you consider this node as part of the solution i.e left=target -
currentNode->data is passed , and consider curren
Given a binary search tree and a target value, find all the paths (if there
exists more than one) which sum up to the target value. It can be any path
in the tree. It doesn't have to be from the root.
--
Amitesh
--
Hi
This is my new Android App with following features
It protects your important data(SMS, Emails etc) in Case your phone is Lost
App automatically detects the Phone Lost Or SIM Change.
In Case Your Phone Lost App sends SMS to You with following Info.
1: Currently used Phone Number on Lost Phone
I hope this will help you
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=dynProg
On Thursday, November 15, 2012 4:01:02 PM UTC+5:30, Sarath wrote:
>
> Are there any good resources to understand Dynamic programming and also
> looking for some good problem and step by step solution
Try to read 'Introduction to Algorithms' by CLRS. Also there are videos
available for that course in the MIT's Open Course-ware. The concepts are
explained very nicely. There are also some good tutorials of dynamic
programming on the topcoder. Hope it helps.
On Thu, Nov 15, 2012 at 4:01 PM, Sarath
Don, thanks for the solution, Can u pls explain how a+b gets reduced by
atleast 25%
On Fri, Nov 16, 2012 at 3:42 AM, Don wrote:
> Tail recursion is no different than a loop, so the complexity is the
> same as an iterative solution like this:
>
> int gcd(int a, int b) // For a {
> while(1)
>
One of the best material related to algorithms as well as dynamic
programming
is the lecture notes by Jeff Erickson sir,
you can check it out in the following link :
http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/
--
http://www.cplusplus.com/doc/tutorial/namespaces/
Here is a nice explanation.
On Thu, Nov 15, 2012 at 11:52 AM, Rahul Kumar Dubey wrote:
> "using namespace std" --> it specify that we want to use whole namespace
> named* std .*
>
> In std namespace varous objects like cout, cin ,endl etc are d
10 matches
Mail list logo
