How do you find the best and worst case from a pseudo code?

Question

I was wondering how would I find the best, worst case of this algorithm:

Inputs 
  A: Array of Integers; N: Integer
Variables 
  i, k: Integer
Begin
  for i := N - 2 down to 0 do
    for k := 0 to i do
      if (A[k] > A[k + 1]) then
        swap(A, k, k + 1)
      fi
    od
  od
End

Best case as well as worst case have `O(N**2)` time complexity; the code is a *Bubble sort* implementation (https://en.wikipedia.org/wiki/Bubble_sort) — Dmitry Bychenko, Jan 11 '18 at 19:54

score 0 · Answer 1 · answered Jan 11 '18 at 20:25

0

The worst case is when A is sorted in decreasing order. In that case the "if" statement is executed in every iteration of the nested "for".

answered Jan 11 '18 at 20:25

JJxl

1
3

How do you find the best and worst case from a pseudo code?

1 Answers1