Binary Trees make me sick :(

#131Skel1Posted 3/4/2013 12:36:54 PM
SnakePaws posted...
I love this board. I've been lurking since I was in high school. I'm about to graduate as a fifth-year senior and nothing has changed. <3


It's true :)
---
http://patrickavella.com/ <> I'm on the intertubes
http://twitter.com/patrickavella <> http://facebook.com/patrick.avella.blog
#132Skel1Posted 3/4/2013 1:20:58 PM
My understanding of a rudimentary hash table is as follows.

You have an array, lets say, of 20,000 buckets (new array[20000])

When inserting an element into the array, you use a hashing function to return a unique ID within the confines of the lookup table/indexes of the area,

int getindex(string identifier) { return somefunc(identifier) % 20000; }

Both when inserting into and reading from the hashmap, you use the full identifer (stored in the data) to make sure there is no collision. So if two elements happen at bucket 514, you traverse the linked list until the identifer matches. This results in access time almost as fast as accessing the index directly and allows for human readable mappings to said indices.

Believe it or not, I did take a data structures class. One of my projects was developing a two pass MIPS assembler that had to use a hash map for the symbol table. I got an A in that class and I went on to become the TA for that class the next year, so I believe I have at least a rudimentary understanding.
---
http://patrickavella.com/ <> I'm on the intertubes
http://twitter.com/patrickavella <> http://facebook.com/patrick.avella.blog
#133ISDcaptain01(Topic Creator)Posted 3/4/2013 9:21:09 PM
Well guys, Im now learning about game trees and minimax trees. This is deep stuff lol
---
lol at --> http://boards.gamefaqs.com/gfaqs/user.php?=89123
#134bob3rt24Posted 3/4/2013 9:31:18 PM
ISDcaptain01 posted...
Well guys, Im now learning about game trees and minimax trees. This is deep stuff lol


THIS IS BIGGER THAN YOU NOW TC!! This is a debate of the fundamentals of data struc..neigh LIFE ITSELF.
---
I've lost my charge, I've been degaussed.
I'm on my own, I've been degaussed.
#135ReconditePhreakPosted 3/4/2013 9:35:20 PM
Go look up what a load factor is, what the effects of a non-uniform hashing algorithm is, and then explain to me why your numbers represent the degenerate case for a hash table. When you're done, perhaps you can educate everyone in this thread on what happens when that hash table passes the load factor threshold in the typical hash table.

Your example *was* the degenerate case I was describing, that you didn't recognize it is exactly my point.
---
Believes the individuals who report to moderators wish they had more control than they do.
#136ReconditePhreakPosted 3/4/2013 9:37:18 PM
THIS IS BIGGER THAN YOU NOW TC!! This is a debate of the fundamentals of data struc..neigh LIFE ITSELF.

Just because you're satisfied being mediocre doesn't mean there aren't others reading this thread who can actually learn from it.

Despite what you might believe, arguing is a great way to learn, but it requires you to let your balls drop, and grow a thick skin.
---
Believes the individuals who report to moderators wish they had more control than they do.
#137PTP2009Posted 3/4/2013 9:42:25 PM
Apparently according to RP, "I didn't mention it" equals "I don't know it".
#138ReconditePhreakPosted 3/4/2013 9:45:16 PM
According to PTP, not being correct is ok as long as you can defend it with "I didn't mention it".
---
Believes the individuals who report to moderators wish they had more control than they do.
#139bob3rt24Posted 3/4/2013 9:48:50 PM
ReconditePhreak posted...
THIS IS BIGGER THAN YOU NOW TC!! This is a debate of the fundamentals of data struc..neigh LIFE ITSELF.

Just because you're satisfied being mediocre doesn't mean there aren't others reading this thread who can actually learn from it.

Despite what you might believe, arguing is a great way to learn, but it requires you to let your balls drop, and grow a thick skin.


Whoa. Why are you throwing the "mediocore" word at me (also can we leave my balls out of this)? I don't have a problem with what either of you are saying. I just find it hilarious how upset you're getting with the simple fact of demystifying data structures is somehow going to be the worst thing on the planet.

What Skel said is correct without the use of performance put in. Once you factor in performance you're damn right there's a hell of a big difference between an array, ll, dbl, bst, etc. You have to take into account what is better for you to use in the work because different data structures are good at different things. You aren't wrong in that regard.

Do you feel better now that you have skel backed into a corner? I think we can go back to talking about other things. Like Fizzbuzz or Interview questions for my Software engineering position Thursday.
---
I've lost my charge, I've been degaussed.
I'm on my own, I've been degaussed.
#140ReconditePhreakPosted 3/4/2013 10:48:53 PM
[This message was deleted at the request of a moderator or administrator]