Which is NOT a limitation of experimental timing studies of algorithms listed in the lecture?
Athe algorithm must already be implemented before timing
Bthe SQL standard forbids stopwatch-based benchmarks
Cresults depend on hardware and language, so cross-algorithm comparison is unreliable
Dit is hard to time the algorithm across all possible inputs
Answer & Solution
Correct answer: B. the SQL standard forbids stopwatch-based benchmarks
Experimental timing requires an implementation, depends on hardware/language/compiler, and cannot cover all possible inputs. SQL standards have nothing to do with algorithm timing methodology. The lecture lists exactly these three real limitations and motivates mathematical (asymptotic) analysis as the alternative.
Related questions
An NP-hard problem differs from an NP-complete one because NP-hard problemsThe first problem proved to be NP-complete wasA problem X is NP-complete if and only ifWhy does theoretical computer science draw the line at 'polynomial-time' for tractability?Which set inclusion is established (i.e., proven, not open)?The class NP is the set of decision problems for whichFloyd-Warshall detects the presence of a negative cycle byTopological sort is well-defined for