Datastrukt komplexiteter operationer

The exercise was created 2022-01-13 by Gustav83. Question count: 25.

Click

Learn the words

Type

Spell the words

Listen

Listen

Games

Play games

Print

Exercise hard copy



Select questions (25)

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

  • [Binary min-heap] Find smallest 1
  • [Binary min-heap] Add log n
  • [Binary min-heap] Remove minimum log n
  • [Unsorted array] Add 1
  • [Unsorted array] Remove n
  • [Unsorted array] Find n
  • [Linked list] Find n
  • [Linked list] Remove n
  • [Linked list] Add 1
  • [BST] Find n
  • [BST] Add n
  • [BST] Remove n
  • [Balanced BST] Find log n
  • [Balanced BST] Add log n
  • [Balanced BST] Remove log n
  • [Hash table] Find 1
  • [Hash table] Add 1
  • [Hash table] Remove 1
  • [Insertion sort] Sorting n^2
  • [Selection sort] Sorting n^2
  • [Mergesort] Sorting n log n
  • [Quicksort] Sorting n log n
  • [Kruskal] Find MST n log n
  • [Prim] Find MST n log n
  • [Dijkstra] Calculate shortest path three n log n

All None

(
Shared exercise

https://spellic.com/eng/exercise/datastrukt-komplexiteter-operationer.10781334.html

)