Time complexity is a type of computational complexity that describes the time
required to execute an algorithm. The time complexity of an algorithm is the
amount of time it takes for each statement to complete. As a result, it is highly
dependent on the size of the processed data.
The average time complexity of the in operator for lists is O(n)