Detour : Big-O Notation
Understand how Big-O notation describes the worst-case running time of algorithms in bioinformatics. Explore why focusing on the fastest-growing term in runtime helps compare algorithm efficiency as data size increases.
We'll cover the following...
We'll cover the following...
Running time of an algorithm
Computer scientists typically measure an algorithm’s efficiency in terms of its worstcase running time, which is the largest ...
Big-O notation compactly describes the running time of an algorithm. For example, if your algorithm for sorting an array of n numbers takes roughly ...