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
I decided to follow this up for two main reasons. First and foremost, there was an error in the original code I posted and I couldn't remember if that error existed in the code I actually tested with or if it was introduced during my writing of the article.
Linkbook is my weekly (or so) series listing interesting technical or science related links. PHP to dotNet compiler qBittorrent: I don't use torrent often but I needed to download a few Ubuntu ISOs
Can we use a Promise to increase the performance throughput of an HTTP web server on Node?
My take for a response to a Code Project thread discussion about a "programmer" vs a "software engineer".