[Oh, man, I got so excited about Pi(e) Day that I forgot all about Wiki Wednesday (so many geeky events, so little time). Here it is, just be sure to change "Wednesday" to "Thursday" and write in "pizza" where it says "machine gun."]
-------------------------------------------------------------------
Time for Wiki Wednesday.
You know - you go to Wikipedia, you click on "random article," you report on the outcome.
Here's my random Wiki Wednesday find for this week:
In computer programming, an unrolled linked list is a variation on the linked list which stores multiple elements in each node. It can drastically increase cache performance, while decreasing the memory overhead associated with storing list metadata such as references. It is related to the skip list and the B-tree.
Does anyone remember Skip List and the B-Trees?. I had all their records.
Comments