      "        * Insert value in temp variable\n",
      "        * Break\n",
      "\n",
      "Complexity:\n",
      "* Time: O(n^2) avarage, worst.  O(1) best if input is already sorted.\n",
      "* Space: O(1), stable"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
 
</s> remove     "* Is a naiive solution sufficient?\n",
 </s> add     "* Is a naive solution sufficient?\n", </s> remove     "* Is a naiive solution sufficient?\n",
 </s> add     "* Is a naive solution sufficient?\n",
    "* Time: O(n^2) avarage, worst.  O(1) best if input is already sorted\n",
    "* Space: O(1) for the iterative solution\n",
    "\n",
    "Misc: \n",
    "\n",
    "* In-place\n",
    "* Stable\n",
    "\n",
    "Insertion sort works well for very small datasets where most of the input is already sorted."
      "        * Insert value in temp variable\n",
      "        * Break\n",
      "\n",
      "Complexity:\n",
    "* Time: O(n^2) avarage, worst.  O(1) best if input is already sorted\n",
    "* Space: O(1) for the iterative solution\n",
    "\n",
    "Misc: \n",
    "\n",
    "* In-place\n",
    "* Stable\n",
    "\n",
    "Insertion sort works well for very small datasets where most of the input is already sorted."
    "* Time: O(n^2) avarage, worst.  O(1) best if input is already sorted\n",
    "* Space: O(1) for the iterative solution\n",
    "\n",
    "Misc: \n",
    "\n",
    "* In-place\n",
    "* Stable\n",
    "\n",
    "Insertion sort works well for very small datasets where most of the input is already sorted."
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
keep keep keep keep replace replace keep keep keep keep keep
 Update insertion sort challenge (#137)

Update constraints and algorithm. 
sorting_searching/insertion_sort/insertion_sort_solution.ipynb