Skip to main content

Initializing a list as blank is the most memory efficient way of doing it - Python Interesting Fact

Initializing list in Python as blank is the most memory efficient way of doing it. Logically this won't make sense, but the program below will prove.
from sys import getsizeof

print('declare a with one element and get size of x')
x = []
print(x)
print(getsizeof(x))

print('declare a with one element and get size of a')
a = ['a']
print(a)
print(getsizeof(a))

print('declare b with two elements and get size of b')
b = ['a','b']
print(b)
print(getsizeof(b))

print('declare c with two elements and get size of c')
c = ['a', 'b', 'c']
print(c)
print(getsizeof(c))

print('append one element and see size of')
x.append('a')
print(x)
print(getsizeof(x))
a.append('b')
print(a)
print(getsizeof(a))
b.append('c')
print(b)
print(getsizeof(b))

print('append another element-list and see size of')
x.append(['b', 'c'])
print(x)
print(getsizeof(x))
a.append(['c', 'd'])
print(a)
print(getsizeof(a))
b.append(['e', 'f'])
print(b)
print(getsizeof(b))

print('append another grouo of elements and see size of')
x.extend(['d', 'e'])
print(x)
print(getsizeof(x))
a.extend(['e', 'f'])
print(a)
print(getsizeof(a))
b.extend(['g', 'h'])
print(b)
print(getsizeof(b))
Output:
declare a with one element and get size of x
[]
64
declare a with one element and get size of a
['a']
72
declare b with two elements and get size of b
['a', 'b']
80
declare c with two elements and get size of c
['a', 'b', 'c']
88
append one element and see size of
['a']
96
['a', 'b']
104
['a', 'b', 'c']
112
append another element-list and see size of
['a', ['b', 'c']]
96
['a', 'b', ['c', 'd']]
104
['a', 'b', 'c', ['e', 'f']]
112
append another grouo of elements and see size of
['a', ['b', 'c'], 'd', 'e']
96
['a', 'b', ['c', 'd'], 'e', 'f']
104
['a', 'b', 'c', ['e', 'f'], 'g', 'h']
112

Comments

Popular posts from this blog

Python - Mathematical Functions - Hexadecimal, Binary, Exponential, Absolute, Round

🐍 Some mathematical functions are in-built in python. Here are some of them. Convert Decimal to Hexadecimal hex(246) Output: '0xf6' hex(512) Output: '0x200' 0x is prefix to all hexadecimal numbers in output. The number after 0x is the hexadecimal value. Convert Decimal to Binary bin(1234) Output: '0b10011010010' bin(246) Output: '0b11110110' bin(512) Output: '0b1000000000' Exponential Function pow() function is similar to num1**num2, but it comes useful when you want to execute (num1**num2)%num3. Passing three arguments to pow(), does this. pow(3,4) Output: 81 This works just like 3**4 pow(3,4,5) Output: 1 But this, works equivalent to (3**4)%5. Either of the two ways can be used. At this point I feel (3**4)%5 is better, as anybody reading the code will understand what is being done immediately. While with pow(2,3,4), the person may have to refer to documentation to understand how this function works. Absolute Value The function abs() is used ...

Two Ways of rendering in React Examples

Two Ways of rendering in React Examples 1 - Render twice HTML < div id = "p1" ></ div > < div id = "p2" ></ div > CSS . person { display : inline - block ; margin : 10px ; border : 1px solid # eee ; box - shadow : 0 2px 2px # ccc ; } JAVASCRIPT (Babel) function Person ( props ) { return ( < div className = ' person "> < h1 >{ props . name }</ h1 > < p > Age :{ props . age }</ p > </ div > ); } ReactDOM . render (< Person name = "VK" age = "29" />, document . querySselector ( '#p1' )); ReactDOM . render (< Person name = "HK" age = "28" />, document . querySselector ( '#p2' )); 2 Render all at once HTML < div id = "app" ></ div > CSS . person { display : inline - block ; margin : 1...

Binary Tree Traversal in Python - In Order, Pre Order, Post Order

Binary Tree Traversal in Python - In Order, Pre Order, Post Order Run the code here to see output:  https://repl.it/@VinitKhandelwal/iterative-traversal-of-binary-tree # Node Class to Create Object of Nodes class Node (): def __init__ ( self , value , left= None , right= None ): self .value = value self .left = left self .right = right # Creation of a Binary Tree class BinaryTree (): def __init__ ( self , mylist ): self .mylist = mylist self .root=Node ( None ) for value in self .mylist : self .curr= self .root self ._add ( value ) def _add ( self , value ): if self .curr.value == None : self .curr.value = value else : if self .curr.value > value : if self .curr.left == None : self .curr.left = Node ( value ) else : self .curr = self .curr.left self ._add ( value ) else : if self...