Скачать или смотреть DSA BUBBLE SORT algorithm |

BUBBLE SORT:-

def bubble_sort(arr):
n = len(arr)
for i in range(n-1):
for j in range(n-i-1):
if arr[j] less than sign. arr[j+1]:
arr[j], arr[j+1] = arr[j+1], arr[j]

nums = [34, 23, 45, 22, 456, 4, 32, 452, 32, 76, 85, 43, 56]
bubble_sort(nums)
print("sorted list :", nums)





ALGORITHM:-


1. Start at the first element of the array.


2. Compare the current element with the next element.


3. If the current element is greater than the next element, swap them.


4. Move to the next position (one index to the right) and repeat steps 2–3 until you reach the end of the array.


5. After the first pass, the largest element is in the last position (it has “bubbled” up).


6. Repeat passes over the array, each time ignoring the last element(s) already sorted.


7. Stop when a full pass makes no swaps (array is sorted), or after n−1 passes for an array of length n.

#coding
#dsa
#datastructure
#python
#pythoncode
#programming
#codinglife
#programminglanguage
#datastructures