Question: Write a specification and implementation for a function that squeezes the duplicates out of a sorted list. For example: >>> x = [1, 1, 3,
Write a specification and implementation for a function that "squeezes" the duplicates out of a sorted list. For example:
>>> x = [1, 1, 3, 3, 3, 4, 5, 5, 8, 9, 9, 10]
>>> squeeze(x)
>>> x
[1, 3, 4, 5, 8, 9, 10]
Test your function thoroughly and analyze its theta efficiency.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
