Imagine that we have a list of names called nameList. There are various algorithms we could run on it. Here's one such algorithm, which compares each name in the list to every other name:

The algorithm has a quadratic time complexity of O(n^2)

Explanation:

The algorithm has two nested for-loop statements. The length of the name list is denoted as "n". Every name searched in the name list has a time complexity of n, therefore the time complexity of finding two names is (n x n) =  n^2, which is denoted as O(n^2) in Big-O notation.

goog may have it for you

to change your username, you must:

1) make sure what the username you want to change to is allowed in this community

2) contact a administrator (for example, jaysl)

3) through pm, tell the admin what you want to change to

4) if the username is allowed, it will be changed in a matter of seconds (minutes at most)

~