As a Any Forumsentleman myself, Tries has to be my favorite.
ITT: your favorite data structure
Anthony Hill
Connor Parker
I like queues
Bentley Brooks
priority heaps
Matthew Russell
only fags care about data structures though
Ayden Rogers
Linked List
I have yet to need anything that is not a linked list
God bless linked lists
Anthony Richardson
filename also hashmap
Dominic Rivera
ez a hash
Ryder Perry
>Blacks in a tree
I like this one too.
James Evans
NIGGGGGER!!!
Owen Kelly
I also like zippers, although there's a zipper for every functional data structure, so they don't really count.
Henry Reyes
>high IQ
Linked lists are elegant, expressive, and can be aggressively optimized by a smart compiler.
>mid IQ
NOOOOOO YOU CAN'T USE A LINKED LIST MY HECKIN CACHERINOOOOOOOOOOOOOOOOO
>low IQ
first points to next, simple as
Gavin Long
Can you explain this to me as if I have no clue what it is?
Jackson Clark
It's an efficient way to represent finite sequences of values in a language like Haskell, where all data is immutable, and the versions of the sequence before and after some operation should share as much as possible. This example represents "thisisnotatree".
Gavin Smith
arrays
Jace Jones
Cute stickbug picture thanks user
Liam Anderson
Quadtree
Grayson Watson
"second generation jump tables" (for lack of better term. i suck at words, i know)
first i make jump tables where i regroup the pointers to relevant fnuctions
then i can pick from there to generate other, dynamic jump tables.
its basically dynamic goto's
avoids a ton of computation
Isaiah Sanders
That's called double dispatch.
Kayden Scott
array
Michael Moore
for me, it's good ol' BST
Jose Scott
I like to put everything in one string and access it with magic numbers.