COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
asymptotic notations represents
|
|
space complexity of algo
|
|
|
time complexity of algo
|
|
|
both a and b
|
|
|
none of the above
|
Explanation:
Detailed explanation-1: -Asymptotic Notation is used to describe the running time of an algorithm-how much time an algorithm takes with a given input, n. There are three different notations: big O, big Theta (), and big Omega ().
Detailed explanation-2: -Asymptotic notations are used to represent the complexity of an algorithm.
Detailed explanation-3: -There are mainly three asymptotic notations: Big-O notation. Omega notation. Theta notation.
Detailed explanation-4: -Asymptotic notations are used to analyze and determine the running time of an algorithm. There are three main types of asymptotic notations: Big-oh notation: Big-oh is used for upper bound values. Big-Omega notation: Big-Omega is used for lower bound values.
There is 1 question to complete.