# set = collection which is unordered, unindexed. No duplicate values utensils = {"fork","spoon","knife"} dishes = {"bowl","plate","cup","knife"} #utensils.add("napkin") #utensils.remove("fork") #utensils.clear() #dishes.update(utensils) #dinner_table = utensils.union(dishes) #print(dishes.difference(utensils)) #print(utensils.intersection(dishes)) for x in utensils: print(x)
They're also great when you _want_ the uniqueness-property. If you use a list, an operation like appending lists has to be written by you (or a framework you use) to manually account for duplicate entries. Sets do it automatically, in C = faster again.
If I am not wrong, you can look to an unordered array for example, you can get any element of the array by the index without being necessary go through each element, but is not in a proper order
