@. DATA STRUCTURE IN PYTHON- COMPLEXITY ANALYSIS ON SETS OPERATIONS смотреть онлайн

Easy way to learn data structures and algorithm programming in simple and easy steps using Python as a programming language.
-------------------------------------------------------------------------------------------------------------------------------------------

Sets:

Length | len(s) | O(1) |
Add | s.add(5) | O(1) |
Containment | x in/not in s | O(1) | compare to list/tuple - O(N)
Remove | s.remove(..) | O(1) | compare to list/tuple - O(N)
Discard | s.discard(..) | O(1) |
Pop | s.pop() | O(1) | popped value "randomly" selected
Clear | s.clear() | O(1) | similar to s = set()

Construction | set(...) | O(len(...))| depends on length of ... iterable
check ==, != | s != t | O(len(s)) | same as len(t); False in O(1) if
the lengths are different
Union | s | t | O(len(s)+len(t))
Intersection | s & t | O(len(s)+len(t))
Difference | s - t | O(len(s)+len(t))
Symmetric Diff| s ^ t | O(len(s)+len(t))

Iteration | for v in s: | O(N) | Worst: no return/break in loop
Copy | s.copy() | O(N) |

Sets have many more operations that are O(1) compared with lists and tuples.
Not needing to keep values in a specific order in a set (while lists/tuples
require an order) allows for faster implementations of some set operations.

Frozen sets support all operations that do not mutate the data structure (and
they have the same complexity classes).

 -----------------------------------------------------------------------------------------------------------------------------------------------------------
LINK RELATED TO SET OPERATIONS: https://www.youtube.com/watch?v=CaOXKZ8aKzU
LINK RELATED PROGRAMS :https://github.com/saritaverma60/python-program
LINK FOR COMPLETE PLAYLIST :https://www.youtube.com/watch?v=8KdqmEmNrYA&list=PLNY8CSQ-shJMYBufq0yD9wvJsgqJfCStd
FACEBOOK LINK: https://www.facebook.com/Kundan-Tutorial-1927301307292166/?modal=admin_todo_tour

#Kundantutorial #settimecomplexit #datastructur #pytho #se #list