Using Bubble Sort

Code

lst = [4, 2, 3, 1]  
n = len(lst) 
for i in range(n): 
   for j in range(0, n-i-1): 
       if lst[j] > lst[j+1]:  
           lst[j], lst[j+1] = lst[j+1], lst[j]
print(lst)  
            

Memory

lst
[0]
4
[1]
2
[2]
3
[3]
1
n
4
i
0
j
0

Visual

pointer 1 Hat 1
[0]
pointer 2 Hat 2
[1]
pointer 3 Hat 3
[2]
pointer 4 Hat 4
[3]
Table