olad

itt we name our fav data structure

I have 2 favorite ones (I couldn't decide to go for just one of them):
- Skip Lists
- Dancing Links

>>37
Big-O is about order of growth of an algorithm. Whether an algorithm is run or not in your program is irrelevant to the order of growth of that algorithm. O(0) is meaningless. Read SICP.