Which of the following options gives lower bound on running time of an algorithm?
a) best case complexity
b) worst case complexity
c) average case complexity
d) no. of iterations taking place in the algorithm

• best case complexity takes lower bound because required time is low
• 11 years agoHelpfull: Yes(13) No(0)
• best case complexity
• 11 years agoHelpfull: Yes(5) No(0)
• it should be the best case time complexity as in best case least time is taken to produce the required output.
• 11 years agoHelpfull: Yes(4) No(0)
• best case complexity gives lower bound on running time of an algorithm
• 10 years agoHelpfull: Yes(2) No(0)
• worst case gives lower bound
  
• 8 years agoHelpfull: Yes(1) No(1)
• worst case complexity gives lower or upper bound on running time of an algorithm
• 11 years agoHelpfull: Yes(0) No(8)
• Average Case complexity deals with time and memory so it will be optimal solution
• 10 years agoHelpfull: Yes(0) No(4)
• a)best case complexity
• 10 years agoHelpfull: Yes(0) No(0)
• worst case complexuty bec f(n)
• 10 years agoHelpfull: Yes(0) No(1)
• worst case complexity
• 4 years agoHelpfull: Yes(0) No(0)