– exponential time complexity algorithms are, for example, brute-force search and traveling salesman problems.*O*(*c*^{k})

An example may be if you had a set of characters of length `c`

, and have the password of length `k`

. Then you would need a

time to break the password, like *O*(*c*^{k})

is trying to break a password by testing every possible combination (assuming *O*(*10*^{n})*numerical* password of length `n`

).