TIME COMPLEXITY QUIZ CODING CLUB

What is the time complexity for this pseudo-code?

• O(N+M)

• O(N)

• O(M)

• O(1)

Will this code run within 1 second in the worst case?

• Yes

• No

• Depends...

Will this code pass within 1 second?

• Yes

• No

• Maybe

Will this code run within a second?

• YES

• NO

• MAYBE

Will this code run in 1 second?

• Yes

• No

• Maybe

Joe currently has a O(N^2) algorithm for a problem where N is up to 10^5. Joe's solution is unfortunately too slow right now. What should Joe do?

• Joe should stop being a noob and come up with a faster algorithm

• Joe can try experimenting with faster languages

• Joe should try optimizing his code (i.e. use less "expensive" operations)

Joe currently has an O(n!) algorithm. N is up to 8. Joe is wondering if his algorithm is fast enough.

• Yes

• No

• Maybe

Which following algorithms has an O(n log n) complexity?

• A. Binary Searching an array of size N for N times

• B. Sorting an array

• C. Searching through an array of size N

• A and B

• A and B and C

Choose the best answer. What is the time complexity of this code?

• O(1)

• O(2)

• O(3)

• O(4)

• O(5)

What's time complexity of this code?

• O(2N)

• O(N)

• O(N^2)

• none of the above