      "        insertion_sort(data)\n",
      "        assert_equal(data, [])\n",
      "\n",
      "        print('One element')\n",
      "        data = [5]\n",
      "        insertion_sort(data)\n",
      "        assert_equal(data, [5])\n",
      "\n",
      "        print('Two or more elements')\n",
      "        data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
      "        insertion_sort(data)\n",
      "        assert_equal(data, sorted(data))\n",
 
</s>
    "        assert_equal(insertion_sort.sort([5]), [5])\n",
      "        insertion_sort(data)\n",
      "        assert_equal(data, [])\n",
      "\n",
      "        print('One element')\n",
    "        assert_equal(insertion_sort.sort([5]), [5])\n",
    "        assert_equal(insertion_sort.sort([5]), [5])\n",
    "        assert_equal(insertion_sort.sort([5]), [5])\n",
      "\n",
      "        print('Two or more elements')\n",
      "        data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
      "        insertion_sort(data)\n",
      "        assert_equal(data, sorted(data))\n",
keep keep keep keep replace replace replace keep keep keep keep keep
 Update insertion sort challenge (#129)

Update constraints, test cases, code, and tests.
sorting_searching/insertion_sort/insertion_sort_solution.ipynb