Wizards Den

KennyBOT

12:12 AM

~ Off to See the Wizard

KennyBOT

2:13 AM

~ The Shade of the Creditors

TheLittleNaruto

3:46 AM

Yo o/

~ Morning Everyone o/

TheLittleNaruto

3:57 AM

0

A: Does Stack Exchange really want to conflate newbies with women/people of color?

Please do not even post such issue, It's not a social platform. on StackOverflow everyone is a developer first, gender or color never comes in picture. We have rich set of FAQ; if one reads it carefully, even if a user is a newbie he'll understand the quality of posts they should post. Better avo...

@Dro Edit if required.

DroidDev

4:10 AM

@PrincessLuna oh...hey Luna

@TheLittleNaruto looks fine to me

TheLittleNaruto

@DroidDev Cool

FOX 9000

@TheLittleNaruto lava (?)

TheLittleNaruto

4:30 AM

I want to know what is @ShadowWizard opinion on my above answer ^

Oh lol someone downvoted my answer

Princess Luna

4:49 AM

@TheLittleNaruto I agree with the concept, but it's slightly malformed imo.

@DroidDev hey ^w^

TheLittleNaruto

@PrincessLuna Can you make a edit Please 😀

Ok thanks

DroidDev

@TheLittleNaruto I think that user is being sarcastic and supporting your point in the comment. Not sure though, listening to songs and writing code, so mind isn't working properly on other things

TheLittleNaruto

5:30 AM

@DroidDev Ohh! I am sorry I didn't get it at first place.

In any case, time to listen to this song: youtube.com/watch?v=DWPIRXzyVDU

DroidDev

@TheLittleNaruto did you check the picture I sent in whatsapp group, about solving complexity of multiple recursive calls to function?

its pretty cool, and once you get it, you'll feel awesome

TheLittleNaruto

@DroidDev Yes I knew this concept, In fact I was asked a question of such kind @Citrix which I failed to solve at that time.

DroidDev

@TheLittleNaruto oh.....so do you get how to solve it now? What if I ask you a similar question, will you be able to gimme its complexity?

TheLittleNaruto

@DroidDev I may try

The main concept to understand that logic is, why it is logn

why not n or 2n or n^2

DroidDev

int f (int n) {
  if (n <= 1)
    return 1;
  return f(n - 1) + f(n - 1) + f(n - 1) + f(n - 1);
}

@TheLittleNaruto what will be the complexity here?

same question

TheLittleNaruto

5:47 AM

@DroidDev It'll be same, Isn't it ? Because In any case depth is same

However space complexity will be more since we're holding values of 4 calls of functions in memory

DroidDev

@TheLittleNaruto wrong, re-read the explanation that I sent

TheLittleNaruto

for every recursive call

@DroidDev wrong in space or time complexity ?

I doubt I am wrong

DroidDev

@TheLittleNaruto in time complexity

TheLittleNaruto

@DroidDev Could you tell me how am I wrong? The screenshot you shared is not that clearly visible.

DroidDev

also, the image that I sent, in it, the time complexity is 2^n, not log n

if you got the image, can you explain why is it 2^n, if you are able to do that, you'll know the complexity here also

TheLittleNaruto

5:53 AM

Will have to read

Gimme 10 minutes

DroidDev

ok

TheLittleNaruto

2 is multiplied because of 2 function branches ? @Dro

DroidDev

@TheLittleNaruto please define "2 function branches". Wasn't able to get that. Also, "why" 2 function branches?

Princess Luna

6:09 AM

@TheLittleNaruto I didn't fix anything though

Transcript for