The document discusses bubble sort, a simple sorting algorithm where each pair of adjacent elements is compared and swapped if out of order. It gets its name because elements "bubble" to their correct positions like bubbles rising in a glass of soda. The algorithm makes multiple passes through the list, swapping elements on each pass until the list is fully sorted. While simple to implement, bubble sort has a slow running time of O(n^2), making it inefficient for large data sets.

2. Why the name ‘Bubble Sort’
•The bubble sort gets its name because elem
ents tend to move up into the correct order
like bubbles rising to the surface.
•or
•The elements of the list "gradually 'bubble'
(or rise) to their proper location in the array
, like bubbles rising in a glass of soda"

3. Data Structure - Bubble Sort
Algorithm
•Bubble sort is a simple sorting algorithm.
•This sorting algorithm is comparison-based
algorithm in which each pair of adjacent
elements is compared and the elements are
swapped if they are not in order.

4. How does a bubble sort algorithm works
?
•Bubble sort algorithms cycle through a list, analyzing p
airs of elements from left to right, or beginning to end.
•If the left most element in the pair is less than the
rightmost element, the pair will remain in that order.
•If the rightmost element is less than the leftmost elemen
t, then the two elements will be switched.
•This cycle repeats from beginning to end until a pass in
which no switch occurs.

5. AlgorithmBubble(a,n)
1.Repeat step2 and 3 for k=1 to n-1
2.Set i=1
3.Repeat while i<=n-k
(a) If a[i]>a[i+1], then
interchange a[i] and a[i+1]
(b) set i=i+1
4. Exit

6. Example A: 5, 12, 3, 9, 16
Pass 1
● 5, 12, 3, 9, 16
○ The list stays the same because 5 is less than 12.
● 5, 12, 3, 9, 16
○ 3 and 12 are switched because 3 is less than 12
● 5, 3, 12, 9, 16
○ 9 and 12 are switched since 9 is less than 12
● 5, 3, 9, 12, 16
○ 12 and 16 do not switch because 12 is less than 16

7. Example A: 5, 12, 3, 9, 16
Pass 2
● 5, 3, 9, 12, 16
○ 3 is less than 5, so they switch
● 3, 5, 9, 12, 16
○ 5 is less than 9 so they remain in the same places
● 3, 5, 9, 12, 16
○ 12 is greater than 9 so they do not switch places
● 3, 5, 9, 12, 16
○ 12 and 16 are in numerical order so they don’t switch.

8. Example A: 5, 12, 3, 9, 16
Pass 3
● 3, 5, 9, 12, 16
○ 3 is less than 5, so they do not switch
● 3, 5, 9, 12, 16
○ 5 is less than 9 so they remain in the same places
● 3, 5, 9, 12, 16
○ 12 is greater than 9 so they do not switch places
● 3, 5, 9, 12, 16
○ 12 and 16 are in numerical order so they don't switch

9. Rabbits And Turtles
•Higher value elements, or elements that occur
at the end of the sequence, take few passes and
switches to get to the right spots. These are calle
d “rabbits”
• Lower value elements move very slowly to thei
r
correct places. These are called “turtles”
2 4 1 8 3
2 4 8 3 1

10. Example 2: 25,17,31,13,2
Lets check

11. Memory Efficiency and Data Structures
● The bubble sort is a very memory-efficient because al
l of the ordering occurs within the array or list itself .
No new memory is allocated.
● No new data structures are necessary, for the same
reason.

12. Advantages of the Bubble Sort
● The bubble sort requires very little memory other than that whi
ch
the array or list .
● The bubble sort is comprised of relatively few lines of code.
● With a best-case running time of O(n), the bubble sort is good fo
r testing whether a list is sorted or not.
● Other sorting methods often cycle through their whole sorting
sequence, which often have running times of O(n^2) or O(n log n
) for this task.
● The same applies for data sets that have only a few items that ne

13. Disadvantages of the Bubble Sort
● The main disadvantage of the bubble sort method is th
e time it requires. With a running time of O(n^2), it is
highly inefficient for large data sets.
● Additionally, the presence of turtles
can severely slow the sort.