Skip to content

Course home

Classification of algorithms

Card 1 of 1

Why is algorithmic complexity measured as a function of problem size nnn rather than in seconds?

A
  • Problem size nnn measures the processor’s clock speed.
  • Complexity gives the algorithm’s exact time in seconds.
B
  • Execution time depends only on the input’s data type.
  • Complexity gives a fixed running time for each algorithm.
C
  • Actual time depends on hardware and software load.
  • Complexity focuses on how the algorithm scales as input grows.
D
  • Actual time is identical on all computer systems.
  • Complexity predicts the algorithm’s exact running time.

Card 1 of 1

Classification of algorithms Flashcards

  1. A Level
  2. /Computer Science
  3. /Classification of algorithms

1 flashcard on AQA A Level Computer Science Classification of algorithms: the key terms and definitions you need to recall.

Flashcards