# 1. BUBBLE SORT
def bubble_sort(arr):
  n = len(arr)
  for i in range(n):
    for j in range(0, n-i-1):
      if arr[j] > arr[j+1]:
        arr[j], arr[j+1] = arr[j+1], arr[j]

# 2. SELECTION SORT
def selection_sort(arr):
  n = len(arr)
  for i in range(n):
    min_idx = i
    for j in range(i+1, n):
      if arr[j] < arr[min_idx]:
        min_idx = j
    arr[i], arr[min_idx] = arr[min_idx], arr[i]

# 3. INSERTION SORT
def insertion_sort(arr):
  for i in range(1, len(arr)):
    key = arr[i]
    j = i - 1
    while j >= 0 and key < arr[j]:
      arr[j+1] = arr[j]
      j -= 1
    arr[j+1] = key

# 4. QUICK SORT
def quick_sort(arr):
  if len(arr) <= 1:
    return arr
  pivot = arr[len(arr)//2]
  left = [x for x in arr if x < pivot]
  mid = [x for x in arr if x == pivot]
  right = [x for x in arr if x > pivot]
  return quick_sort(left) + mid + quick_sort(right)

# 5. MERGE SORT
def merge_sort(arr):
  if len(arr) <= 1:
    return arr
  mid = len(arr)//2
  left = merge_sort(arr[:mid])
  right = merge_sort(arr[mid:])
  return merge(left, right)
def merge(left, right):
  result = []
  i = j = 0
  while i < len(left) and j < len(right):
    if left[i] < right[j]:
      result.append(left[i])
      i += 1
    else:
      result.append(right[j])
      j += 1
  result.extend(left[i:])
  result.extend(right[j:])
  result.extend(right[j:])
  return result

# 6. HEAP SORT
def heapify(arr, n, i):
  largest = i
  left = 2*i + 1
  right = 2*i + 2
  if left < n and arr[left] > arr[largest]:
    largest = left
  if right < n and arr[right] > arr[largest]:
    largest = right
  if largest != i:
    arr[i], arr[largest] = arr[largest], arr[i]
    heapify(arr, n, largest)
def heap_sort(arr):
  n = len(arr)
  # Build max heap
  for i in range(n//2 - 1, -1, -1):
    heapify(arr, n, i)
  # Extract elements
  for i in range(n-1, 0, -1):
    arr[i], arr[0] = arr[0], arr[i]
    heapify(arr, i, 0)

# SAMPLE RUN FOR ALL SORTING METHODS
arr = [64, 34, 25, 12, 22, 11, 90]
print("Original:", arr)
a1 = arr.copy()
bubble_sort(a1)
print("Bubble Sort:", a1)
a2 = arr.copy()
selection_sort(a2)
print("Selection Sort:", a2)
a3 = arr.copy()
insertion_sort(a3)
print("Insertion Sort:", a3)
a4 = quick_sort(arr.copy())
print("Quick Sort:", a4)
a5 = merge_sort(arr.copy())
print("Merge Sort:", a5)
a6 = arr.copy()
heap_sort(a6)
print("Heap Sort:", a6)