60 C93 C R94 C R95 C R96 C RR97 C R

97 A R

8 seconds read

Here is a part of a table consisting of the best, average, and worst cases for different abstract algorithms. Find cases that can't be true in any way.

Number of a case	Best case	Average case	Worst case
1	$O(1)$	$O(n^2)$	$O(n \cdot log \: n)$
2	$O(n \cdot log \: n)$	$O(n)$	$O(n \cdot log \: n)$
3	$O(n^2)$	$O(n^2)$	$O(n^2)$
4	$O(n)$	$O(1)$	$O(n^2)$
5	$O(n \cdot log \: n)$	$O(n \cdot log \: n)$	$O(\infin)$

How did you like the theory?

Report a typo