Answer:
The answer is "Option A"
Explanation:
In the OOPs programming language, the class and object concept is used, in which class is a collection of data members, and member function and object is known as real-time entity. In the class when the main method is created, so inside this method class object is created that's why the answer to this question is true.
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
You Need Software To Screen Capture
The Software You can use is OBS its free and there are watermarks