Do you even know what horizontal lines are because it is for certain not present in that picture . The e is definetly too accentuated though . <| sep |> Obviously there ' s a lot of dubious deals about today , but I ' m not by any means against it . There was one thing I was interested in buying this year . It was over 100 yesterday , it ' s 80 today , it ' s occasionally on sale at 100 . I guess it ' s about not getting caught up in the hype , which seems to be low this year anyway . <| sep |> im not sure whats worse reading that sentence , or the fact i laughed so hard water came out of my nose when i read it <| sep |> For as long as it lasts , you are now the most hilarious person on the planet . <| sep |> if the link previous to the link being added or removed is maintained during list traversal . Which in practice it pretty much never is unless you are treating it like a stack or queue and only doing operations at the ends . Typically , a search to locate the insertion point a linear search is required . This linear search is over memory with poor locality of reference which blows out your CPU cache , resulting in pretty much the worst performance possible . I got down voted above for posting a video of Bjarne Stroustrup profiling linked list against a vector which does recopying and showing that the recopying of a vector which has good locality of reference is still much more efficient than the cost of a linear traversal to the middle of a linked list . Why I got down voted for this useful piece of information I can only assume is willful ignorance , but basically , given modern architectures with large CPU caches and plentiful memory , the linked list is pretty much obsolete for general collection use . The other drawback , of course , is that the linked list is often one of the most space inefficient collection implementations around , making it the worst choice almost every single time .