For the following pseudocode functions, choose the big O notation that accurately describes its worst-case complexity.

function getFirstElement(elements : Array<Int>) : Int
  return elements[0]
end function

function displayPairsFromList(elements : Array<Int>)
  i : Int = 0
  size : Int = elements.count()
  loop (while i < size)
    j : Int = 0
    loop (while j < size)
      display(elements[i] + ", " + elements[j])
      j = j + 1
    end loop
    i = i + 1
  end loop
end function

function recursive(number : Int) : Int
  if (number <= 1)
    return number
  end if

  return recursive(number - 4) + recursive(number - 2)
end function

Data Structures & Algorithms Algorithmic Thinking Complexity Public


Would you like to see our other questions?

We have 1000+ premium hand-crafted questions for 160+ job skills and 20+ coding languages. We prefer questions with small samples of actual work over academic problems or brain teasers.

Visit our question library
Private Concierge

Send us an email with an explanation of your testing needs and a list of candidates. We will create an appropriate test, invite your candidates, review their results, and send you a detailed report.

Contact Private Concierge

Would you like to see our tests? The following tests contain Data Structures & Algorithms related questions:
On the TestDome Blog

Screening Applicants: The Good, the Bad and the Ugly

Since we’re all biased and we use incorrect proxies, why not just outsource hiring to experts or recruitment agencies? After all, they’ve been screening people for many years, so they must know how to do it right?

Not really. I was surprised to discover that many experts disagree with each other. Everybody praises their pet method and criticizes the others. Many of these methods look legitimate, but are based on...

Dashboard Start Trial Sign In Home Tour Tests Questions Pricing