Anonymous
I want it in c
Anonymous
Someone give me this program now
Anonymous
Do your own homework
Anonymous
Oh I see, ok, thanks again
Anonymous
Do your own homework
Really you won't give it to me
Anonymous
Sure, I would appreciate that, Thanks. Yes the complexity makes total sense. I've seen the map out performs arrays for related problems with small inputs.
Dima
/warn read the rules
kdkdkddddddkddd
Discuss advantage of protected access vs private access in the base class with the help of an example.
kdkdkddddddkddd
who can explain me?
Dima
Discuss advantage of protected access vs private access in the base class with the help of an example.
private members can’t be accessed within derived classes, while protected can be
Artöm
Yes
Anonymous
Oh thanks, for taking the trouble, this would definitely do.
Anonymous
what is the solution to this with c programming
klimi
what is the solution to this with c programming
the solution would be a c program
Anonymous
yes
klimi
yes
you're welcome
Anonymous
👍
Anonymous
how to write the code?
Dima
Anonymous
how to write the code?
Maybe you want to look at the implementation of a BST( Binary Search Tree) in C.
Anonymous
Is it not Quadratic probing? Let me know if i'm wrong.
Anonymous
what book is this?
Anonymous
Oh I see. Does that adds up to the linear time the hashmap has for insertion?
Anonymous
oh
Anonymous
I think I understand it now, thanks for the explaination. Also the book seems to be interesting, didn't consider going through it before, but maybe I should.
Dima
lol
Anonymous
I was speechless xD
Anonymous
@admin
Anonymous
I was wondering, why would they need to resort to such things, was photoshop not enough. And photoshop does uses a lot of c++ libraries, I assume.
Anonymous
Anonymous
lol
admeme edit: oof admeme gone
Anonymous
+
i forwarded to spamwatch, let's get him gbanned
Dima
@admin
got the same, btw its /report
Dima
/ban @Jenilpatel pm’d everyone, yt link, read the rules.
Rania
thought it was just me got random pm 🤦‍♀
Anonymous
/report works when replying to nothing?
Anonymous
got the same, btw its /report
doesn't work saar
Anonymous
don't purge please
klimi
got the same, btw its /report
@admin works too afaik
Anonymous
same :P
help on spamwatch
Dima
lmaooooooo
Anonymous
lmaooooooo
Hey need to ask about this guy that was banned I think it's jenil? Not sure
Dima
yes, one more idiot
Dima
Another one bites the dust...! Banned Jenil. Reason: pm’d everyone, yt link, read the rules.
Anonymous
Nah I just had a hunch something was up with the report but I guess there's nothing wrong
Dima
lol gg that massive spam
Anonymous
lol gg that massive spam
You should see how it was reported
Anonymous
Couple of forwards that you cannot prove meant anything and source is "this Guy's C group"
Anonymous
You should see how it was reported
forwarded the spammed message. tagged an admin of the group that was present there
Anonymous
Anybody would think it was a little suspicious
klimi
forwarded the spammed message. tagged an admin of the group that was present there
ya normally you send some like rose message with link to message and id
Anonymous
yes
this guy specifically
Anonymous
Dima
this pointer?
no, a reference
Dima
Anonymous
Anonymous
no, a reference
But a pointer holds a reference
Anonymous
ya normally you send some like rose message with link to message and id
okay i didn't know that. but i tagged you because you are known there and would eventually verify it
Anonymous
>coding in C BTW @K11M1
Anonymous
That's really some daring there
Anonymous
what is the solution to this with c programming
This is really simple BST implementation
Tushar Goel
Use dp
What is dp
Anonymous
// the first node is called root root=null // root calls createbst() with itself passed as an argument root=createbst(root) // the type of root is void * and the actual data structure is: struct bst *root; // definition on the data structure struct bst { struct bst* left; struct bst*right; int value; }
klimi
*sigh*
Tushar Goel
But i have to do this question by recursion
Anonymous
Createbst will first check if root node has a value. If the next value to insert is less it goes to the left and calls itself Otherwise go right Otherwise if you get a duplicate value those are not allowed and you can stop the program