Computer Forums Serious Question
 Register FAQ Members List Calendar Search Today's Posts Mark Forums Read

 11-16-2006, 05:35 PM #1 In Runtime     Join Date: Apr 2006 Posts: 291 Serious Question Hi guys. Im currently trying to program a Binary tree in java. Now - this implementation must be fully recursive. Do you think a set of N should be used for this problem? I have been thinking about it for quite some time - other than that - all i can see if some sort of log n arithmetic. I wondered if i could possibly even use the schlagelhoch tree balancing algorithm but this doesnt use a set of N, shoud i perhaps try using a bubblesort on a set of X instead? Any ideas? Thanks __________________ __________________ Referred to by : UK31337 Visit http://www.pens2paper.com - For Your Stationery Needs!
 11-16-2006, 06:12 PM #2 Fully Optimized     Join Date: Feb 2005 Posts: 2,776 Re: Serious Question You need to take the root, insert it into both left and right node, and then assign the whole new array to the set of N. Then, you can perform the binary search (ie log n) on the set of N, which will give you a balanced AVL tree. The set of X is only used when you're deleting the contents of a map, idiot Even then, it's not CPU efficient, the Bjuren-Cooper bubblesort inverse insertion algorithm is so much faster. __________________ __________________ Master of common sense. If you don't like it, stop reading.
 11-17-2006, 07:12 AM #3 In Runtime     Join Date: Apr 2006 Posts: 291 Re: Serious Question How, the Bjuren-Cooper bubblesort inverse insertion must traverse the set of n squared... Are you sure that the set of n actually parses the integer complexity by 2 dp the stack overflow seems to represent this fairly methodically. The set of x can be used in more than the deleting contents of a map - god what a frickin noob. I have used it more than 8 times on the linton-ionosphere cakeeater algorithm so i really dont know what you mean - it looks like this so fair a[i] for x = a to bjuren{ n.setof(x) +-%67. Any ideas? __________________ Referred to by : UK31337 Visit http://www.pens2paper.com - For Your Stationery Needs!
 11-17-2006, 07:16 AM #4 Golden Master     Join Date: Sep 2006 Posts: 6,798 Re: Serious Question Pure BS lol
 11-17-2006, 07:29 AM #5 In Runtime     Join Date: Apr 2006 Posts: 291 Re: Serious Question excuse me? that is proper java syntax for the binary tree declaration..... please dont insult my work if you dont know what you are talking about please dont answer. Thanks. __________________ Referred to by : UK31337 Visit http://www.pens2paper.com - For Your Stationery Needs!
 11-17-2006, 08:01 AM #6 Golden Master     Join Date: Sep 2006 Posts: 6,798 Re: Serious Question Ha ha ya right, thought ya were taking the piss lol. Just googled it
 11-17-2006, 08:11 AM #7 In Runtime     Join Date: Apr 2006 Posts: 291 Re: Serious Question Mind showing me the code result for the google search then mr - would love to see it. __________________ Referred to by : UK31337 Visit http://www.pens2paper.com - For Your Stationery Needs!
 11-17-2006, 08:34 AM #8 Golden Master     Join Date: Sep 2006 Posts: 6,798 Re: Serious Question found ya bubblesort, thats only part i checked mr http://www.ece.unb.ca/brp/lib/java/bubblesort/
 11-17-2006, 08:37 AM #9 Fully Optimized     Join Date: Aug 2006 Posts: 1,599 Re: Serious Question hahah looks like complete Gibberish 2 me __________________ __________________ - Asus P6T Deluxe v2 - Intel i7 920 @4Ghz 1.35v- Prolimatech HS - Cosmos S Case - - ABS Tagan BZ Series BZ800 PSU - ATI 5870 - G.SKILL 6GB DDR3 1600 - Razer Barracuda™ AC-1 - 120GB Crucial C300 SSD & 3X WD640AAKS HDD - Dell 24" 2408WFP & 2407WFP-HC Monitor