Answer:
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.
