Just reporting a minor typo in "The Myth of RAM, part III":
Current Text: "Iterating through a linked list is a O(N√N) operation. A binary search is a O(√N) operation. A hash map lookup is a O(√N) operation."
Corrected Text: "Iterating through a linked list is a O(N√N) operation. A binary search is a O(log(N)√N) operation. A hash map lookup is a O(√N) operation."
Thanks for writing this series, which I've very much enjoyed reading!
Just reporting a minor typo in "The Myth of RAM, part III":
Current Text: "Iterating through a linked list is a O(N√N) operation. A binary search is a O(√N) operation. A hash map lookup is a O(√N) operation."
Corrected Text: "Iterating through a linked list is a O(N√N) operation. A binary search is a O(log(N)√N) operation. A hash map lookup is a O(√N) operation."
Thanks for writing this series, which I've very much enjoyed reading!
All the best,
-Jonathan