diff --git a/arrays_strings/reverse_string/reverse_string_solution.ipynb b/arrays_strings/reverse_string/reverse_string_solution.ipynb index 18a2aae..05f6a82 100644 --- a/arrays_strings/reverse_string/reverse_string_solution.ipynb +++ b/arrays_strings/reverse_string/reverse_string_solution.ipynb @@ -36,7 +36,6 @@ "source": [ "## Constraints\n", "\n", - "* Can I assume the string is ASCII?\n", " * Yes\n", " * Note: Unicode strings could require special handling depending on your language\n", @@ -92,11 +91,14 @@ }, "outputs": [], "source": [ + "from __future__ import division\n", + "\n", + "\n", "def list_of_chars(chars):\n", " if chars is None:\n", " return None\n", " size = len(chars)\n", - " for i in range(size/2):\n", + " for i in range(size//2):\n", " chars[i], chars[size-1-i] = \\\n", " chars[size-1-i], chars[i]\n", " return chars" diff --git a/sorting_searching/merge_sort/merge_sort_solution.ipynb b/sorting_searching/merge_sort/merge_sort_solution.ipynb index 93da0ea..fbc7ef4 100644 --- a/sorting_searching/merge_sort/merge_sort_solution.ipynb +++ b/sorting_searching/merge_sort/merge_sort_solution.ipynb @@ -113,7 +113,7 @@ "def merge_sort(data):\n", " if len(data) < 2:\n", " return data\n", - " mid = int(len(data) / 2)\n", + " mid = len(data) // 2\n", " left = data[0:mid]\n", " right = data[mid:len(data)]\n", " left = merge_sort(left)\n", diff --git a/sorting_searching/quick_sort/quick_sort_solution.ipynb b/sorting_searching/quick_sort/quick_sort_solution.ipynb index 471f9f9..1304015 100644 --- a/sorting_searching/quick_sort/quick_sort_solution.ipynb +++ b/sorting_searching/quick_sort/quick_sort_solution.ipynb @@ -94,7 +94,7 @@ " return data\n", " left = []\n", " right = []\n", - " pivot_index = int(len(data) / 2)\n", + " pivot_index = len(data) // 2\n", " pivot_value = data[pivot_index]\n", " \n", " # Build the left and right partitions\n",