When working with arrays, you’ll often have to search through them to check if they contain a target element. You can always run a sequential search—scanning the array from the beginning to the end—on the array. But if the array is sorted, running th… » freeCodeCamp.org | freecodecamp.org
An algorithm is a set of well-defined instructions for solving a specific problem. You can solve these problems in various ways. This means that the method you use to arrive at the same solution may differ from mine, but we should both get the same r… » olawanletjoel | freecodecamp.org
The Big O is a way to measure how well your code solves a problem » hackernoon.com | hackernoon.com
In this article I would do my best to introduce you to algorithmic complexity and a way to roughly… » DEV Community | dev.to
Worst case When calculating for the Big O of algorithms we’re supposed to assume the… » DEV Community | dev.to
Big(O) is the way in which we compare algorithmic complexities of two programs in a standard… » DEV Community | dev.to
-Intro to Big O -Timing Our Code -Counting… » DEV Community | dev.to
Introduction I have been in Software Engineering for a decade and a half and I am not a Co… » DEV Community | dev.to
Why beginners should not be afraid of AL As a code newbie, I have read a few posts that sa… » DEV Community | dev.to
If you’re reading this, and haven’t read part one in the series I recommend reading that first. There… » DEV Community | dev.to