Consider the following algorithm to remove all duplicates from an array: Sort the array. For each element in the array, look at its next neighbor to decide whether it is present more than once. If so, remove it. Is this a faster algorithm than the one in Exercise R14.15?

Data from Exercise R14.15?

Your task is to remove all duplicates from an array. For example, if the array has the values

4     7     11     4     9     5     11     7     3     5

then the array should be changed to

4 7 11 9 5 3

Here is a simple algorithm: Look at a[i]. Count how many times it occurs in a. If the count is larger than 1, remove it. What is the growth rate of the time required for this algorithm?