Big O

The exercise was created 2025-05-24 by knasbth. Question count: 10.




Select questions (10)

Normally, all words in an exercise is used when performing the test and playing the games. You can choose to include only a subset of the words. This setting affects both the regular test, the games, and the printable tests.

All None

  • Insertionsort O(n2)
  • Selectionsort O(n2)
  • Linearsearch O(n)
  • Binarysearch O(log n)
  • Mergesort O(n log n)
  • Quicksort worst case O(n2)
  • Quicksort average O(n log n)
  • Heapsort O(n log n)
  • Countingsort O(n + k)
  • Radixsort O(nk)

All None

(
Shared exercise

https://spellic.com/eng/exercise/big-o.12554279.html

)