The jumping problem

#1

How recurrence is taking 2^N time… at (22:29)
and pls ek baar tell how ki exponentiation me k^3LOGN me LOGN kyo aa raha he…

#2

there is a method of exponentiation which works in LOGN.
thats why it is logn

#3

and k^3 for matrix multiplication

#4

And can you give the explaination of 2^N reccurence time at 22:29 in the video

#5

see, let there be n steps that a person can jump.
so now the person has two choices that the person jumps at that step or doesnt jump at that step.
therefore for all n choices 2^N ka recurrence .

1 Like