Set time complexity python

# empty set, avoid using {} in creating set or dictionary is created
x = set() 

# set {'e', 'h', 'l', 'o'} is created in unordered way
B = set('hello') 

# set{'a', 'c', 'd', 'b', 'e', 'f', 'g'} is created
A = set('abcdefg') 

# set{'a', 'b', 'h', 'c', 'd', 'e', 'f', 'g'} 
A.add('h')    

fruit ={'orange', 'banana', 'pear', 'apple'}

# True  fast membership testing in sets
'pear' in fruit      

'mango' in fruit     # False

A == B       # A is equivalent to B

A != B       # A is not equivalent to B

A <= B    # A is subset of B A <B>= B    

A > B     # A is proper superset of B

A | B        # the union of A and B

A & B     # the intersection of A and B

A - B        # the set of elements in A but not B

A ˆ B        # the symmetric difference

a = {x for x in A if x not in 'abc'}   # Set Comprehension

Similar codes

1 vote173 views1 answer
Installing packages from requirements.txt file
Python
140 votes181 views3 answers
Windows python pip upgrade
Python
12 votes170 views2 answers
Python sorted function descending
Python
0 vote173 views1 answer
Multiple arguments with multiprocessing python
Python
0 vote174 views1 answer
Python - row slice dataframe by number of rows
Python
3 votes192 views1 answer
Load pandas from text
Python
2 votes184 views1 answer
How to install dask in python
Python
1 vote187 views1 answer
Start index from 1 in python
Python
0 vote183 views1 answer
Identify Null and NAN python
Python
0 vote171 views1 answer
Issue AttributeError: ‘numpy.ndarray’ object has no attribute ‘index’
Python