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.
Top comments (0)