This question was previously asked in

NIELIT Scientist B Official Paper 2020

- 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.

Option 1 : the least or smallest of all the running times the algorithm takes, on inputs of a particular size.

Free

NIC Scientist B 2020: Full Mock Test

2764

120 Questions
120 Marks
180 Mins

**Concept:**

The best-case complexity of the algorithm is the function defined by the minimum number of steps taken on any instance of size n.

Therefore the best running time is defined as the least or smallest of all the running times the algorithm takes, on inputs of a particular size.

__Additional Information__

The worst-case complexity of the algorithm is the function defined by the maximum number of steps taken on any instance of size n.

The average-case complexity of the algorithm is the function defined by the average number of steps taken on any instance of size n.

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,29,58,676+ Students

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)