What do you mean by complexity of an algorithm ?

---

The complexity of an algorithm is a function f (n) which measures the time and space used by an algorithm in terms of input size n.

In computer science, the complexity of an algorithm is a way to classify how efficient an algorithm is, compared to alternative ones. The focus is on how execution time increases with the data set to be processed. The computational complexity and efficient implementation of the algorithm are important in computing, and this depends on suitable data structures.

Quote: All our dreams can come true, if we have the courage to pursue them...|| It always seems impossible until it's done || Failure will never overtake me if my determination to succeed is strong enough. || Believe in yourself. You are braver than you think, more talented than you know, and capable of more than you imagine...|| Believe in yourself, take on your challenges, dig deep within yourself to conquer fears. Never let anyone bring you down. You got to keep going...||