      "        func(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",
      "        func(data)\n",
      "        assert_equal(data, sorted(data))\n",
      "\n",
      "        print('Success: test_selection_sort\\n')\n",
      "\n",
 
</s> remove     "    for i in range(0, len(data) - 1):\n",
 </s> add     "    for i in range(len(data)-1):\n", </s> remove     "* Space: O(1) iterative, O(n) recursive (unless tail-call elimination is available, then O(1)), generally not stable\n",
 </s> add     "* 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",
    "        data = [5, 1, 7, 2, 6, -3, 5, 7, -10]\n",
      "        func(data)\n",
      "        assert_equal(data, [5])\n",
      "\n",
      "        print('Two or more elements')\n",
    "        data = [5, 1, 7, 2, 6, -3, 5, 7, -10]\n",
      "        func(data)\n",
      "        assert_equal(data, sorted(data))\n",
      "\n",
      "        print('Success: test_selection_sort\\n')\n",
      "\n",
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_challenge.ipynb