In at least C++, a list search is O(n) and a set search is either O(log(n)) or O(1) depending on the specific type of set. The linear search of a list is due to the fact that lists are implemented as linked lists. The set search complexity is logarithmic if you're using a set implemented with some form of binary tree or constant if you're using an unordered_set which utilizes hash tables.