Bubble Sort Useing python

Bubble Sort Useing Python 2.7

Bubble Sort is simple sorting Algorithm which wark step by step sorting according to the passes or iteration

---

---

Rules to sort

• Number of iteration or passes is to be done is eqal to number of element in the list
• Compare each pare of adjesent two numbers

• Swaps them untill the no swaps are needed

Strategy To be use to write python code

• Use list to take input
• Append is python define list function
• For loop of "X" varible is to number of passes or iteration
• For loopof "XX" is for no of sorting in single pass to be done

PYTHON CODES

Code Useing Simple Python

o_list=[] #define empty list print 'Number of Element to be sort' no_element=input('>') for i in range(0,no_element): num=int(input('>')) o_list.append(num) print 'Your Unsorded List is :-', print o_list #sording Algorithem for x in range(0,no_element): #no of times check the list is sort or not for xx in range(0,no_element-x-1): #3 compare to be done in(2,3,4,5) if(o_list[xx]>o_list[xx+1]): temp=o_list[xx] o_list[xx]=o_list[xx+1] o_list[xx+1]=temp print o_list

 C:\Users\rushi\Desktop\mypyDec>python bubbleSort.py
Number of Element to be sort
>4
>3
>1
>8
>6
Your Unsorded List is :- [3, 1, 8, 6]
[1, 3, 6, 8]

Pyhton Program using class is little bit large but easy to understand.

• Class Name of "sortAlgo" is use .
• Many Function is use to make program simple to understand.
• "__init__" is constracter used to define empty List "o_list"

PYTHON CODES

Code Useing Class Concept and Function

class sortAlgo(): def __init__(self): self.o_list=[] def take_input(self): print 'Enter Number of Element to be sort' self.no_element=input('>>') print 'Enter Element' for x in range(0,self.no_element): num=int(input('>')) self.o_list.append(num) self.printList(self.o_list) print 'Your Unsorded List is:-', self.printList(self.o_list) #call sorting function self.sortList(self.o_list) def printList(self,PrintL): print PrintL def sortList(self,o_list): for x in range(0,self.no_element): for xx in range(0,self.no_element-x-1): #3 compare to be done in(2,3,4,5) if(o_list[xx]>o_list[xx+1]): #here i return 2 values from fun sort2Number o_list[xx],o_list[xx+1]=self.sort2Number(o_list[xx],o_list[xx+1]) print 'Your sorded List is:-', self.printList(self.o_list)#call print function def sort2Number(self,num1,num2): temp=num1 num1=num2 num2=temp return num1,num2 #creating object obj1=sortAlgo() #calling function take_input obj1.take_input()

C:\Users\rushi\Desktop\mypyDec>python bubbleSortClass.py
Enter Number of Element to be sort
>>4
Enter Element
>3
[3]
>1
[3, 1]
>8
[3, 1, 8]
>6
[3, 1, 8, 6]
Your Unsorded List is:- [3, 1, 8, 6]
Your sorded List is:- [1, 3, 6, 8]

C:\Users\rushi\Desktop\mypyDec>