View Single Post
Old 02 August 2015, 18:46   #190
Thorham
Computer Nerd

Thorham's Avatar
 
Join Date: Sep 2007
Location: Rotterdam/Netherlands
Age: 41
Posts: 2,972
Quote:
Originally Posted by Mrs Beanbag View Post
it's not exactly head-bending, but it takes a lot more code than a simple array and a linear search.
A plain hash table based string table search doesn't even take twice as much code as a plain string compare version, and that's not exactly a lot to begin with. Especially in C it's not much code at all. The basic hash table is a very simple data structure, after all. That's why it's a bad example for complexity.

Quote:
Originally Posted by Mrs Beanbag View Post
you're not arguing about the R/B Tree though i see!
I'm embarrassed to say I've never actually implemented a binary tree before Can't possibly complicated, though

Quote:
Originally Posted by Mrs Beanbag View Post
well ok, i was a little careless there. it CAN. but it would take hours rather than seconds. especially with the number of triangles we're dealing with (a few thousand to represent a sphere).
Hours? Is that stuff really that heavy?
Thorham is offline  
 
Page generated in 0.04945 seconds with 9 queries