favorite data structures?
Name:
Anonymous
2015-03-15 1:15
Mine are the binary tree and zipper
Name:
Anonymous
2015-03-15 1:52
Cons cell.
Name:
Anonymous
2015-03-15 2:38
Arrays.
Name:
Anonymous
2015-03-15 2:45
Double linked lists.
Name:
Anonymous
2015-03-15 3:43
I probably enjoy programming binary trees the most, but get the most use out of hash tables.
Name:
Anonymous
2015-03-15 7:10
lambdas
Name:
Anonymous
2015-03-15 7:56
arglist tuples(void.h)
Name:
Anonymous
2015-03-15 8:28
Crit-bit trees.
Name:
Anonymous
2015-03-15 10:45
Now I'm going to open my zipper!
Name:
Anonymous
2015-03-15 20:53
Stack.
Name:
Alexander Dubček
2015-03-15 20:54
favourite data type?
Mine is the double.
Name:
Anonymous
2015-03-15 21:00
>>10I'm a gonna smash it
! I'm a gonna
smash it!
Name:
Anonymous
2015-03-16 17:15
I'm a fan of the gap buffer.
Name:
Anonymous
2015-03-17 1:34
Hashtables.
Name:
Anonymous
2015-03-17 3:22
Hey guys
Guys
What about
Hey guys
What about hash tables that
What about
Hash tables that end with self-balancing binary trees?
Name:
Anonymous
2015-03-17 7:19
>>16Patent it immediately
!
Name:
Anonymous
2015-03-17 8:11
Proprietary Stack-Allocated Judy Arrays
Name:
Anonymous
2015-03-18 1:41
Hash trees are sortable in O(1) time. It's proven in Knuth's TAoCPv5.
Name:
Anonymous
2015-03-18 9:11
>>20Everything is sortable in O(1) if you are determined.
Name:
Anonymous
2015-03-18 9:27
>>22Big enough values of O(1) should be called O(2)
Name:
Anonymous
2015-03-19 1:10
>>22I propose writing O(X) as O(k·X) so people stop writing moronic things like O(log
somethingn).
Name:
Anonymous
2015-03-19 4:21
Global variables.
Name:
Anonymous
2015-03-21 4:00
pisser
Newer Posts