"foo"=="foo"? OH SHI-


haxus_the_great@leetbawx: cat anus.c
int main()
{
  if ("foo" == "foo") {
    return 1;
  } else {
    return 0;
  }
}
haxus_the_great@leetbawx: gcc anus.c -o anus
haxus_the_great@leetbawx: ./anus
haxus_the_great@leetbawx: echo $?
1
haxus_the_great@leetbawx:
U mad? U jelly? Come at me bro.

>>22
You can implement a hash table, but looking up shit from it is not constant. Hash table lookup's complexity is O(n) in average and worst cases due to collisions and chaining that's usually done with linked lists.
 
Yes, I said average case is linear. Hash table has fixed amount of buckets, and given massive enough input it just degenerates to a linked list with several buckets. This is really elementary stuff isn't it?

Ergo, deal with it.