I wanted to share an old graduate school project I have in my GitHub account. I return to this project as a reference. Not to remind myself of the core pattern but to
I think this illustrates the concept of Big-O complexity pretty good. O(1): random access to an element in a collection, dependent on indexing O(n): list iterations O(n^2): nested loops
This site runs, in part, on a reverse proxy (along with the Ghost publishing platform). What is that? Why is it used? I don't know when it came about but this concept has