Bubble Sort In Python - WeArGenius
This is a simple program which demonstrates the implementation of the bubble sort algorithm in python. The complexity of the program is O(n2) . The Input is taken from the console and then appended to a list, which is further processed . Output Screen: Program : print 'Enter the list of elements followed by space:'x=raw_input();x=map(int,x.split())for i in range(0, len(x)-1): for j in range(0,len(x)-i-1): if(x[j]>x[j+1]): swp=x[j] x[j]=x[j+1] x[j+1]=swpprint x Found suggestions, Please comment them here !
Post to Tumblr