input: 
  def insertion_sort(list):
      for i in range(1,len(list)):
          key = list[i]
          j = i - 1
          while j>=0 and key < list[j]:
              list[j+1] = list[j]
              j-=1
          list[j+1] = key
      return list
  
  # Test cases for insertion_sort function
  print(insertion_sort([5, 3, 1, 4, 6]))  # Output: [1, 3, 4, 5, 6]
  print(insertion_sort([3, 2, 1]))       # Output: [1, 2, 3]
  print(insertion_sort([]))              # Output: []
  print(insertion_sort([1]))             # Output: [1]
  
output:     for i in range(1,len(list)):
          key = list[i]
          j = i - 1
          while j>=0 and key < list[j]:
              list[j+1] = list[j]
              j-=1
          list[j+1] = key
      return list