When Big O Does and Does Not Matter

Richard Burd — Wed, 28 Apr 2021 22:38:24 +0000

Abstract: There are times when the big O notation of a programming algorithm will not predict performance in a meaningful manner, and then there are times when the opposite is true. This article attempts to first illustrate why this is the case in abstract terms, and then show a strategy for selecting an optimal algorithm, or in some cases multiple algorithms, to be implemented in a software build.

Due to the numerous code snippets, graph links, and native image resizing, this article could not be published directly on dev.to and instead is available here on my personal webpage.

I would appreciate any feedback on errors that this community could bring to my attention; I look forward to making the necessary corrections.

Optional Chaining in JavaScript ES2020 Illustrated

Richard Burd — Thu, 17 Dec 2020 17:56:13 +0000

Optional Chaining is one of the more popular features in the ECMAScript 2020 standard. Here's an illustration on how it works:

NOTE: the full-resolution version is available here.

This image above will be the cornerstone in the next edition of my cheat sheet series, but for now it can be filed away in you personal zettelkasten (for quick reference) if it may be of use later on.

DEV Community: Richard Burd

When Big O Does and Does Not Matter

Optional Chaining in JavaScript ES2020 Illustrated