Bubble Sort
In bubble sort, each element is compared with its adjacent element. If the first element is larger than the second one then the position of the elements is interchanged, otherwise it is not changed. Then next element is compared with its adjacent element and the same process is repeated for all the element in the array. During the next pass the same process is the largest leaving the largest element. During the pass, the second largest element occupies the second last position. During the next pass, the same process is repeated leaving the largest the element. During this pass, the largest element occupies the n-1 position. The same process is repeated until no more elements are left for comparison. Finally the array is sorted one.
INITIAL EELMENTS (without sorting)
11
15
2
13
6
Analysis of Bubble Sort
In the Bubble sort the first pass require (n-1) comparisons to fix the highest element to its location, the second pass require (n-2),....., kth pairs requires (n-k) and the last pass requires only one comparison to be fixed at its proper position.
Therefore the total comparisons are
F (n) = (n-1) + (n-2) + (n-3) +....+ (n-k)+3+2+1=n (n-1)\2
F (n) = 0 (n2)
Data Structure & Algorithms Assignment Help, Live Experts
Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.
ExpertsMind.com - Bubble Sort Assignment Help, Bubble Sort Homework Help, Bubble Sort Assignment Tutors, Bubble Sort Solutions, Bubble Sort Answers, Sorting Assignment Tutors