GATE Computer Science (CS) 2012 Solved Paper

© examsiri.com
Question : 28 of 65
 
Marks: +1, -0
Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE
Go to Question: