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 vote272 views1 answer
.lift tkinter
Python
0 vote183 views1 answer
Djanog admin cookbook change text
Python
1 vote214 views2 answers
Python zip function
Python
0 vote228 views1 answer
Prefetched_related django rest framework
Python Django
0 vote195 views1 answer
How to take first half of list python
Python
9 votes220 views6 answers
Django filters
Python
3 votes183 views6 answers
Django login
Python
4 votes212 views3 answers
How to convert list into csv in python
Python
0 vote237 views1 answer
Split into list into even chunks
Python
2 votes192 views1 answer
Who is a pythonista
Python