Changes

== PART 2 - Sets ==u ca :Sets So far, you have been exposed to two structures that are another very similar structure used to contain data: lists, they and tuples. You can also be modified and changed, unlike modify the tuple. But sets have two unique characteristics, they are unordered, and they cannot have duplicate values. The unordered part provides within a added performance from hashing list as well as modify the valuesstructure of a list (i.e. add and remove elements), but also means we whereby you cannot pull out with a specific value at a spefici positiontuple. Any duplicate entries  :In this section, you will immediately be deletedlearn about '''sets'''. A set has similar characteristics as a list, but there are two major differing characteristics: ::*Sets however are great tools '''un-ordered'''::*Sets '''cannot contain duplicate values''' These characteristics make sets very useful for doing performing tasks such as comparisons, : finding similarities or differences in multiple sets. In fact, you are not permitted to create duplicate entries within sets, or finding similaritiessince the new duplicate entries will be automatically removed. The best part about Also, operations involving sets are, they are considered to be fast!