LIST
operation | Big-O Efficiency |
---|---|
l i s t [ i n d e x ] list[index] list[index] | O ( 1 ) O(1) O(1) |
l i s t [ i n d e x ] = i t e m list[index]=item list[index]=item | O ( 1 ) O(1) O(1) |
l i s t . a p p e n d ( i t e m ) list.append(item) list.append(item) | O ( 1 ) O(1) O(1) |
l i s t . p o p ( ) list.pop() list.pop() | O ( 1 ) O(1) O(1) |
l i s t . p o p ( i n d e x ) list.pop(index) list.pop(index) | O ( n ) O(n) O(n) |
l i s t . i n s e r t ( i n d e x , i t e m ) list.insert(index,item) list.insert(index,item) | O ( n ) O(n) O(n) |
d e l o p e r a t o r del\ operator del operator | O ( n ) O(n) O(n) |
i t e r a t i o n iteration iteration | O ( n ) O(n) O(n) |
i t e m i n l i s t item\ in\ list item in list | O ( n ) O(n) O(n) |
l i s t [ x : y ] list[x:y] list[x:y] | O ( k ) O(k) O(k) |
d e l l i s t [ x : y ] del\ list[x:y] del list[x:y] | O ( n ) O(n) O(n) |
l i s t [ x : y ] = [ i t e m s ] list[x:y]=[items] list[x:y]=[items] | O ( n + k ) O(n+k) O(n+k) |
r e v e r s e reverse reverse | O ( n ) O(n) O(n) |
l i s t 1 + l i s t 2 list1+list2 list1+list2 | O ( k ) O(k) O(k) |
l i s t . s o r t ( ) list.sort() list.sort() | O ( n l o g n ) O(nlogn) O(nlogn) |
l i s t ∗ k list*k list∗k | O ( n k ) O(nk) O(nk) |
DICT
operation | Big-O Efficiency |
---|---|
d i c t . c o p y ( ) dict.copy() dict.copy() | O ( n ) O(n) O(n) |
d i c t . g e t ( ) dict.get() dict.get() | O ( 1 ) O(1) O(1) |
d i c t [ k e y ] = v a l u e dict[key]=value dict[key]=value | O ( 1 ) O(1) O(1) |
d e l d i c t [ k e y ] del\ dict[key] del dict[key] | O ( 1 ) O(1) O(1) |
k e y i n d i c t key\ in\ dict key in dict | O ( 1 ) O(1) O(1) |
i t e r a t i o n iteration iteration | O ( n ) O(n) O(n) |