      "    * If min < current element, swap\n",
      "\n",
      "Complexity:\n",
      "* Time: O(n^2) average, worst, best\n",
      "* Space: O(1) iterative, O(n) recursive (unless tail-call elimination is available, then O(1)), generally not stable\n",
      "    * Note: Tail call elimination is not inherently available in Python. See the following [StackOverflow post](http://stackoverflow.com/a/13592002)."
     ]
    },
    {
     "cell_type": "markdown",
 
</s> remove     "    for i in range(0, len(data) - 1):\n",
 </s> add     "    for i in range(len(data)-1):\n", </s> remove     "        data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
 </s> add     "        data = [5, 1, 7, 2, 6, -3, 5, 7, -10]\n",
    "* Space: O(1) iterative, O(m) recursive where m is the recursion depth (unless tail-call elimination is available, then O(1)), generally not stable\n",
      "    * If min < current element, swap\n",
      "\n",
      "Complexity:\n",
      "* Time: O(n^2) average, worst, best\n",
    "* Space: O(1) iterative, O(m) recursive where m is the recursion depth (unless tail-call elimination is available, then O(1)), generally not stable\n",
      "    * Note: Tail call elimination is not inherently available in Python. See the following [StackOverflow post](http://stackoverflow.com/a/13592002)."
     ]
    },
    {
     "cell_type": "markdown",
keep keep keep keep replace keep keep keep keep keep
 Polish selection sort challenge and solution

Update constraints, algorithm, code, and test. 
sorting_searching/selection_sort/selection_sort_solution.ipynb