Question

Which on the following is a Space Complexity
A. O(1)
B. O(n)
C. O(n log(n))
D. O(m)
E. O(mn)

Answer 1

Reason:

O(1) - Heap, Bubble, Insertion, Selection.

O(n) - Quick Sort

So, the answer will be Option (C).

Hope it helps!

Answer 2

Option C is the answer for space complexity.

There are two main complexities which are present in all the major algorithms.

They are Time Complexity and Space Complexity.

Space Complexity of a particular algorithm is defined as the amount of memory required to solve a problem after giving the inputs.

It is generally considered in the worst case scenario . It plays an important role in judging the efficiency of an algorithm developed by the engineers.