Horje

PYTHON implementation - Bubble Sort - Algorithm
Learn
Algorithm - Bubble Sort - Python implementation
Python Implementation
#!/usr/bin/python

input_list = [10,1,2,11]

for i in range(len(input_list)):
  for j in range(i):
    if int(input_list[j]) > int(input_list[j+1]):
      input_list[j],input_list[j+1] = input_list[j+1],input_list[j]

print input_list

Parameters

Parameter Description
Stable Yes
In place Yes
Best case complexity O(n)
Average case complexity O(n^2)
Worst case complexity O(n^2)
Space complexity O(1)
Read Article
https://develop.horje.com/learn/1434/reference