Computational Complexity Theory - What are examples of computational complexity?

An example of a computational complexity problem is a function problem, in which each input is anticipated to yield a single output of the overall function. But it's not as easy as answering yes or no; the result is more complicated than a choice dilemma. Two well-known examples are the integer factorization problem and the traveling salesman issue.