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

0 vote338 views1 answer
Vscode python region folding
Python
0 vote323 views1 answer
Return a new RDD by applying a function to each element of this RDD.
Python
0 vote360 views1 answer
Find maximum element in stack
Python
0 vote403 views1 answer
Django action when create model
Python Django
0 vote342 views1 answer
Find prime numbers in a given range for big input python
Python
0 vote398 views1 answer
How i rwrite conditon to create 1 or 0 label from two probability column python
Python
0 vote373 views2 answers
Empty set in python
Python
0 vote342 views2 answers
PrintThis is not a function
Python
22 votes361 views6 answers
Readlines from file python
Python
0 vote357 views1 answer
Packing and unpacking in python
Python