- creating a binary tree - 1 Update
- Failed interview test - 3 Updates
- Vector of Objects - 1 Update
| Jerry Stuckle <jstucklex@attglobal.net>: Nov 20 05:47PM -0500 On 11/20/2016 2:24 AM, Popping mad wrote: > incase you want to look up. > How can you build this? A recursive function goes straight down the left > side. https://www.tutorialspoint.com/data_structures_algorithms/avl_tree_algorithm.htm has a good example of algorithms It's not too hard to balance one once you understand the rotations. And the overhead of maintaining balance is pretty low. I did it in C, but that's been probably 25 years ago and I don't have that code any more. But the code wasn't that big. -- ================== Remove the "x" from my email address Jerry Stuckle jstucklex@attglobal.net ================== |
| Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Nov 20 06:09PM On 20/11/2016 15:50, Paavo Helde wrote: > On 20.11.2016 14:45, Mr Flibble wrote: >> However a reference may occupy a region of storage like a pointer object. > It may or may not. The standard says: [snip] What I said was correct. Saying something "may" do something is equivalent to saying something "may or may not" do something with the second bloated form containing more superfluous redundancy than the first so STOP BEING SO FUCKING PEDANTIC YOU ANNOYING CUNT. /Flibble |
| woodbrian77@gmail.com: Nov 20 10:29AM -0800 On Sunday, November 20, 2016 at 12:10:03 PM UTC-6, Mr Flibble wrote: Please don't swear here. Brian Ebenezer Enterprises http://webEbenezer.net |
| red floyd <no.spam.here@its.invalid>: Nov 20 10:34AM -0800 > On Sunday, November 20, 2016 at 12:10:03 PM UTC-6, Mr Flibble wrote: > Please don't swear here. Shut the fuck up about it already. |
| Jorgen Grahn <grahn+nntp@snipabacken.se>: Nov 20 05:45PM On Sun, 2016-11-20, 嘱 Tiib wrote: > After that the 'main' ends that causes destruction of original 'c2' > original 'c1' and then 'myvec' and so copies of 'c1' and 'c2' in that > 'myvec'. So 5 calls. And: this behavior of the standard containers (that they actually /contain/ objects) has turned out to be pretty successful. It rarely becomes a performance issue. I remember worrying about that back in 2001 or so; perhaps that's what the OP is worrying about today, although he fails to communicate it. /Jorgen -- // Jorgen Grahn <grahn@ Oo o. . . \X/ snipabacken.se> O o . |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment