Input Size

The problem input size is usually denoted by n, which is usually the number of items handled by the algorithm. For example, for sorting and searching algorithms, the array size n will be input size. Sometimes it is more appropriate to describe the size of the input with two numbers rather than one. For instance, if the input to an algorithm is a graph, the input size can be described by the number of vertices and edges in the graph. In analyzing algorithms, input size of the problem will be indicated.