GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-03 07:58:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Changed xrange to range to be compatible with Python 3.

Browse Source
This commit is contained in:
Donne Martin
2015-07-06 06:15:53 -04:00
parent fac7bbb1be
commit 45fa576bc2
21 changed files with 41 additions and 42 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
sorting_searching/insertion_sort/insertion_sort_solution.ipynb
View File

@@ -88,8 +88,8 @@
"def insertion_sort(data):\n",
" if len(data) < 2:\n",
" return\n",
" for r in xrange(1, len(data)):\n",
" for l in xrange(0, r):\n",
" for r in range(1, len(data)):\n",
" for l in range(0, r):\n",
" if data[l] > data[r]:\n",
" temp = data[r]\n",
" data[l+1:r+1] = data[l:r]\n",

2
sorting_searching/quick_sort/quick_sort_solution.ipynb
View File

@@ -97,7 +97,7 @@
" pivot_value = data[pivot_index]\n",
" \n",
" # Build the left and right partitions\n",
" for i in xrange(0, len(data)):\n",
" for i in range(0, len(data)):\n",
" if i == pivot_index:\n",
" continue\n",
" if data[i] < pivot_value:\n",

4
sorting_searching/selection_sort/selection_sort_solution.ipynb
View File

@@ -86,7 +86,7 @@
"source": [
"def find_min_index(data, start):\n",
" min_index = start\n",
" for i in xrange(start + 1, len(data)):\n",
" for i in range(start + 1, len(data)):\n",
" if data[i] < data[min_index]:\n",
" min_index = i\n",
" return min_index\n",
@@ -121,7 +121,7 @@
"def selection_sort_iterative(data):\n",
" if len(data) == 0 or len(data) == 1:\n",
" return\n",
" for i in xrange(0, len(data) - 1):\n",
" for i in range(0, len(data) - 1):\n",
" swap(data, i, find_min_index(data, i))"
]
},