today the day of thurs oct 5
i learned about a skiplist which is on wikipedia too.
it has an O(log n) lookup for each element because it points to end or to bigger element halfway through the list.
https://en.wikipedia.org/wiki/Skip_list
it is faster lookup but same space as a linked list. ok i guess.Â












