BubbleSort algorithm in python

Although Bubblesort algorithm is not an efficient one with respect to space and time complexity, its one of the easiest one to understand. Here is a bubblesort implementation in python

Asymptotic Complexity
Time Complexity	Space Complexity
n^2	1

If you would like to see how this implentation would look like in C click the following link: Bubblesort implementation in C

	#! /usr/env/path python
	arr = [6,5,4,7,8,4,3,2,1,45,23,67,34]
	def bubble_sort(arr):
	swapped, j = True, 1
	length = len(arr)
	while(swapped):
	swapped = False
	for i in range(0,length-j):
	if( arr[i] >= arr[i+1] ):
	temp = arr[i]
	arr[i] = arr[i+1]
	arr[i+1] = temp
	swapped = True
	j += 1
	print(arr)
	bubble_sort(arr)
	print(arr)

view raw bubblesort.py hosted with ❤ by GitHub