Running time for converting list to set in Python

Question

In Python, what are the running time and space complexities if a list is converted to a set?

Example:
data = [1,2,3,4,5,5,5,5,6]

# this turns list to set and overwrites the list
data = set(data)

print data 
# output will be (1,2,3,4,5,6)

Answer 1

Converting a list to a set requires that every item in the list be visited once, O(n). Inserting an element into a set is O(1), so the overall time complexity would be O(n).

Space required for the new set is less than or equal to the length of the list, so that is also O(n).

Here's a good reference for Python data structures.