which of the following is a drawback to analysing algorithms by proving 0-upper bounds on the worst case?
Answers
Answer:
Hope this helps
Step-by-step explanation:
In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) that an algorithm requires given an input of arbitrary size (commonly denoted as n or N). It gives an upper bound on the resources required by the algorithm
Answer:
The drawback is the worst-case complexity measures the resources such as running time, memory that an algorithm requires given an input of arbitrary size.
Step-by-step explanation:
An algorithm is defined as a procedure used for solving a problem or performing a computation.
It is an exact list of instructions that conduct specified actions step by step.
It is typically used to solve a class of specific problems or to perform a computation.
The drawback is the worst-case complexity measures the resources such as running time, memory that an algorithm requires given an input of arbitrary size.
It provides upper bound on the resources required by the algorithm.
#SPJ2