Buble short

# Optimized Bubble sort in Python

def bubbleSort(array):
    
  # loop through each element of array
  for i in range(len(array)):
        
    # keep track of swapping
    swapped = False
    
    # loop to compare array elements
    for j in range(0, len(array) - i - 1):

      # compare two adjacent elements
      # change > to < to sort in descending order
      if array[j] > array[j + 1]:

        # swapping occurs if elements
        # are not in the intended order
        temp = array[j]
        array[j] = array[j+1]
        array[j+1] = temp

        swapped = True
          
    # no swapping means the array is already sorted
    # so no need for further comparison
    if not swapped:
      break

data = [-2, 45, 0, 11, -9]

bubbleSort(data)

print('Sorted Array in Ascending Order:')
print(data)

Source: programiz.com

Similar codes

0 vote205 views1 answer
Pd.concat has nan
Python
1 vote196 views1 answer
Python seaborn violin plot fit data better
Python
0 vote220 views1 answer
Python string: .find()
Python
3 votes194 views2 answers
Python find location of module
Python
75 votes206 views2 answers
Python find item in list
Python
2 votes235 views1 answer
Python buffer
Python
0 vote198 views1 answer
Text generate gpt 2 huggingface
Python
5 votes191 views4 answers
C code to python code converter online
Python
0 vote185 views1 answer
Math expressions with matplotlib
Python
0 vote219 views1 answer
Django Signup view
Python