Big O v2

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

Click

Learn the words

Type

Spell the words

Listen

Listen

Games

Play games

Print

Exercise hard copy



Select questions (16)

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)
  • Binära Sök Träd average O(log n)
  • Binära Sök Träd worst O(n)
  • Heap Insertion/Delete O(log n)
  • Heap Root (prioritet) O(1)
  • Bygga Heap O(n)
  • Hash Maps find,delete,add average O(1)

All None

(
Shared exercise

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

)