Big O

The performance (speed) of the algorithm under optimal conditions.

• Best Case

• Worst Case

• Average Case

In a linear search, the item being searched is the first item in the list.

• Best Case

• Worst Case

• Average Case

The performance of the algorithm in the most unfavourable conditions.

• Best Case

• Worst Case

• Average Case

In a linear search, the item being searched is the last item in the list.

• Best Case

• Worst Case

• Average Case

The performance of the algorithm in expected normal conditions.

• Best Case

• Worst Case

• Average Case

Unless stated otherwise, Big O represents the...

• Best Case

• Worst Case

• Average Case

Rank 1 in terms of efficiency

• Constant

• Logarithmic

• Linear

• Polynomial

• Exponential

Rank 2 in terms of efficiency

• Constant

• Logarithmic

• Linear

• Polynomial

• Exponential

Rank 3 in terms of efficiency

• Constant

• Logarithmic

• Linear

• Polynomial

• Exponential

Rank 5 in terms of efficiency

• Constant

• Logarithmic

• Linear

• Polynomial

• Exponential