0 votes 0 votes The best running time is defined as/obtained as/by: the least or smallest of all the running times the algorithm takes, on inputs of a particular size an input that requires maximum computations or resources averaging the different running times for all inputs of a particular kind none of the options Unknown Category nielit-scb-2020 + – gatecse asked Dec 9, 2020 • edited Dec 12, 2020 by soujanyareddy13 gatecse 420 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes a - best case b- worst case c- average case so clearly A is the answer Asim Siddiqui 4 answered Mar 5, 2021 Asim Siddiqui 4 comment Share Follow See all 0 reply Please log in or register to add a comment.