Analysis of Algorithms (original) (raw)

An ___ is defined as a set of well-defined instructions used to accomplish a particular task.

___ of an algorithm is the amount of time required for it to execute.

___ is the maximum amount of time an algorithm takes to execute a specific set of inputs.

• Average case time complexity
• Worst case time complexity
• Best case time complexity

___ within the limit deals with the behavior of a function for sufficiently large values of its parameter.

Which one of the following helps in calculating the longest amount of time taken for the completion of the algorithm?

There are 5 questions to complete.

Take a part in the ongoing discussion