Learn Sorting Algorithms with Python

                                

def swap(arr, left_pos, right_pos):
  temp = arr[left_pos]
  arr[left_pos] = arr[right_pos]
  arr[right_pos] = temp

def bubble_sort(arr):
  n = len(arr)
  for _ in range(n):
      swapped = False
      for idx in range(n - 1):
          if arr[idx] > arr[idx + 1]:
              swap(arr, idx, idx + 1)
              swapped = True
      # If no elements were swapped, the list is already sorted
      if not swapped:
          break


                              

                                

def swap(arr, pos_1, pos_2):
  tmp = arr[pos_1]
  arr[pos_1] = arr[pos_2]
  arr[pos_2] = tmp


                              

                                

num1, num2 = num2, num1  # swaps values of num1 and num2


                              

                                

num1, num2 = num2, num1  # swapping values in Bubble Sort


                              

                                

1) Split the list into smaller lists until each list has one element.
2) Merge these single-element lists into sorted lists of two elements, then four, and so on.


                              

                                

def merge_sort(lst):
  if len(lst) <= 1:
    return lst
  middle = len(lst) // 2
  left = lst[:middle]
  right = lst[middle:]
  sleft = merge_sort(left)
  sright = merge_sort(right)
  return merge(sleft, sright)

def merge(left, right):
  result = []
  while left and right:
    if left[0] < right[0]:
      result.append(left.pop(0))
    else:
      result.append(right.pop(0))
  result += left + right
  return result