make this bubble sort python code shorter than this?

Question

i don't know if it can be made shorter than this

def bubble_sort(num):
  for j in range((len(num)-1)):
     for i in range((len(num)-1)):
        if(num[i]>num[i+1]): num[i] , num[i+1] = num[i+1],num[i]       
 return num
print (bubble_sort(list(input("enter the array/list elements:"))))

Answer 1

I'm ignoring the function call right now and just golfing the function itself. I'm also assuming this is Python 2, since the original had a print statement rather than function.

Shorten variable names, remove excess whitespace and brackets

116 bytes

def b(n):
 for j in range(len(n)-1):
  for i in range(len(n)-1):
   if n[i]>n[i+1]:n[i],n[i+1]=n[i+1],n[i]
 return n

Try it online!

Change first for loop to repeat n times

102 bytes

def b(n):
 for j in n:
  for i in range(len(n)-1):
   if n[i]>n[i+1]:n[i],n[i+1]=n[i+1],n[i]
 return n

Try it online!

Change if statement to one liner

98 bytes

def b(n):
 for j in n:
  for i in range(len(n)-1):n[i:i+2]=n[i:i+2][::(n[i]<n[i+1])*2-1]
 return n

Try it online!

Change for loop to exec

96 bytes

def b(n):exec"for i in range(len(n)-1):n[i:i+2]=n[i:i+2][::(n[i]<n[i+1])*2-1]\n"*len(n);return n

Try it online!

Combine exec and for loop

94 bytes

def b(n):i=0;exec"n[i:i+2]=n[i:i+2][::(n[i]<n[i+1])*2-1];i+=1;i%=len(n)-1;"*len(n)**2;return n

Try it online!