Day 1

Question 1

What is meant by N?

Answer 1

N is the problem size.
Ex: Sorting an array of N elements.
Ex: Searching for an item in a set of N elements.
Ex: Inserting an item into a set of N elements.

Question 2

What does the amount of work done by a certain algorithm usually a depend on?

Answer 2

The amount of work done or the runtime usually depends on N. Or Is a function of N.

Question 3

For what problem size does complexity matter the most?

Answer 3

Large problem size.

When N is large there is a huge difference between N and N^2.