Computer scienceAlgorithms and Data StructuresIntro to algorithms and data structuresUnderstanding algorithms and complexity analysis

Big O: how to count it

Theory

Why do we talk about big numbers?

Report a typo

You have a task and you want to choose the best algorithm to solve it. The input size is $n$ .

The first algorithm needs to do $n^2$ operations to solve your task. Another algorithm requires $1000*n$ operations. You know that in your case $n<=100$ . Which algorithm should you choose?

Select one option from the list

The first

The second

___

Create a free account to access the full topic