mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-04 00:18:02 +00:00
Renamed top-level folders to use underscores instead of dashes.
This commit is contained in:
Donne Martin
0
sorting_searching/__init__.py
Normal file
0
sorting_searching/__init__.py
Normal file
170
sorting_searching/insertion-sort.ipynb
Normal file
170
sorting_searching/insertion-sort.ipynb
Normal file
@@ -0,0 +1,170 @@
|
||||
{
|
||||
"cells": [
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://bit.ly/code-notes).</i></small>"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Problem: Implement insertion sort.\n",
|
||||
"\n",
|
||||
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
|
||||
"* [Test Cases](#Test-Cases)\n",
|
||||
"* [Algorithm](#Algorithm)\n",
|
||||
"* [Code](#Code)\n",
|
||||
"* [Unit Test](#Unit-Test)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Constraints and Assumptions\n",
|
||||
"\n",
|
||||
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
|
||||
"\n",
|
||||
"* Are you looking for a naiive solution?\n",
|
||||
" * Yes"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Test Cases\n",
|
||||
"\n",
|
||||
"* Empty input\n",
|
||||
"* One element\n",
|
||||
"* Two or more elements"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Algorithm\n",
|
||||
"\n",
|
||||
"Wikipedia's animation:\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"* For each value index 1 to n - 1\n",
|
||||
" * Compare with all elements to the left of the current value to determine new insertion point\n",
|
||||
" * Hold current value in temp variable\n",
|
||||
" * Shift elements from new insertion point right\n",
|
||||
" * 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": {},
|
||||
"source": [
|
||||
"## Code"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 1,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"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",
|
||||
" if data[l] > data[r]:\n",
|
||||
" temp = data[r]\n",
|
||||
" data[l+1:r+1] = data[l:r]\n",
|
||||
" data[l] = temp\n",
|
||||
" break"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Unit Test\n",
|
||||
"\n",
|
||||
"*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand. You generally will not be asked to write a unit test like what is shown below.*"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 2,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [
|
||||
{
|
||||
"name": "stdout",
|
||||
"output_type": "stream",
|
||||
"text": [
|
||||
"Empty input\n",
|
||||
"One element\n",
|
||||
"Two or more elements\n",
|
||||
"Success: test_insertion_sort\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"from nose.tools import assert_equal\n",
|
||||
"\n",
|
||||
"class Test(object):\n",
|
||||
" def test_insertion_sort(self):\n",
|
||||
" print('Empty input')\n",
|
||||
" data = []\n",
|
||||
" insertion_sort(data)\n",
|
||||
" assert_equal(data, [])\n",
|
||||
"\n",
|
||||
" print('One element')\n",
|
||||
" data = [5]\n",
|
||||
" insertion_sort(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",
|
||||
" insertion_sort(data)\n",
|
||||
" assert_equal(data, sorted(data))\n",
|
||||
" \n",
|
||||
" print('Success: test_insertion_sort')\n",
|
||||
"\n",
|
||||
"if __name__ == '__main__':\n",
|
||||
" test = Test()\n",
|
||||
" test.test_insertion_sort()"
|
||||
]
|
||||
}
|
||||
],
|
||||
"metadata": {
|
||||
"kernelspec": {
|
||||
"display_name": "Python 2",
|
||||
"language": "python",
|
||||
"name": "python2"
|
||||
},
|
||||
"language_info": {
|
||||
"codemirror_mode": {
|
||||
"name": "ipython",
|
||||
"version": 2
|
||||
},
|
||||
"file_extension": ".py",
|
||||
"mimetype": "text/x-python",
|
||||
"name": "python",
|
||||
"nbconvert_exporter": "python",
|
||||
"pygments_lexer": "ipython2",
|
||||
"version": "2.7.10"
|
||||
}
|
||||
},
|
||||
"nbformat": 4,
|
||||
"nbformat_minor": 0
|
||||
}
|
||||
190
sorting_searching/merge-sort.ipynb
Normal file
190
sorting_searching/merge-sort.ipynb
Normal file
@@ -0,0 +1,190 @@
|
||||
{
|
||||
"cells": [
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://bit.ly/code-notes).</i></small>"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Problem: Implement merge sort.\n",
|
||||
"\n",
|
||||
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
|
||||
"* [Test Cases](#Test-Cases)\n",
|
||||
"* [Algorithm](#Algorithm)\n",
|
||||
"* [Code](#Code)\n",
|
||||
"* [Unit Test](#Unit-Test)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Constraints and Assumptions\n",
|
||||
"\n",
|
||||
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
|
||||
"\n",
|
||||
"* Are you looking for a naiive solution?\n",
|
||||
" * Yes"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Test Cases\n",
|
||||
"\n",
|
||||
"* Empty input\n",
|
||||
"* One element\n",
|
||||
"* Two or more elements\n",
|
||||
"* Left and right subarrays of different lengths"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Algorithm\n",
|
||||
"\n",
|
||||
"Wikipedia's animation:\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"* Recursively split array into left and right halves\n",
|
||||
"* Merge split arrays\n",
|
||||
" * Using two pointers, one for each half starting at index 0\n",
|
||||
" * Add the smaller element to the result array\n",
|
||||
" * Inrement pointer where smaller element exists\n",
|
||||
" * Copy remaining elements to the result array\n",
|
||||
" * Return result array\n",
|
||||
"\n",
|
||||
"Complexity:\n",
|
||||
"* Time: O(n log(n))\n",
|
||||
"* Space: O(n), stable"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Code"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 1,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"def merge(left, right):\n",
|
||||
" l = 0\n",
|
||||
" r = 0\n",
|
||||
" result = []\n",
|
||||
" while l < len(left) and r < len(right):\n",
|
||||
" if left[l] < right[r]:\n",
|
||||
" result.append(left[l])\n",
|
||||
" l += 1\n",
|
||||
" else:\n",
|
||||
" result.append(right[r])\n",
|
||||
" r += 1\n",
|
||||
" while l < len(left):\n",
|
||||
" result.append(left[l])\n",
|
||||
" l += 1\n",
|
||||
" while r < len(right):\n",
|
||||
" result.append(right[r])\n",
|
||||
" r += 1\n",
|
||||
" return result\n",
|
||||
"\n",
|
||||
"def merge_sort(data):\n",
|
||||
" if len(data) < 2:\n",
|
||||
" return data\n",
|
||||
" mid = len(data) / 2\n",
|
||||
" left = data[0:mid]\n",
|
||||
" right = data[mid:len(data)]\n",
|
||||
" left = merge_sort(left)\n",
|
||||
" right = merge_sort(right)\n",
|
||||
" return merge(left, right)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Unit Test\n",
|
||||
"\n",
|
||||
"*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand. You generally will not be asked to write a unit test like what is shown below.*"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 2,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [
|
||||
{
|
||||
"name": "stdout",
|
||||
"output_type": "stream",
|
||||
"text": [
|
||||
"Empty input\n",
|
||||
"One element\n",
|
||||
"Two or more elements\n",
|
||||
"Success: test_merge_sort\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"from nose.tools import assert_equal\n",
|
||||
"\n",
|
||||
"class Test(object):\n",
|
||||
" def test_merge_sort(self):\n",
|
||||
" print('Empty input')\n",
|
||||
" data = []\n",
|
||||
" merge_sort(data)\n",
|
||||
" assert_equal(data, [])\n",
|
||||
"\n",
|
||||
" print('One element')\n",
|
||||
" data = [5]\n",
|
||||
" merge_sort(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",
|
||||
" data = merge_sort(data)\n",
|
||||
" assert_equal(data, sorted(data))\n",
|
||||
" \n",
|
||||
" print('Success: test_merge_sort')\n",
|
||||
"\n",
|
||||
"if __name__ == '__main__':\n",
|
||||
" test = Test()\n",
|
||||
" test.test_merge_sort()"
|
||||
]
|
||||
}
|
||||
],
|
||||
"metadata": {
|
||||
"kernelspec": {
|
||||
"display_name": "Python 2",
|
||||
"language": "python",
|
||||
"name": "python2"
|
||||
},
|
||||
"language_info": {
|
||||
"codemirror_mode": {
|
||||
"name": "ipython",
|
||||
"version": 2
|
||||
},
|
||||
"file_extension": ".py",
|
||||
"mimetype": "text/x-python",
|
||||
"name": "python",
|
||||
"nbconvert_exporter": "python",
|
||||
"pygments_lexer": "ipython2",
|
||||
"version": "2.7.10"
|
||||
}
|
||||
},
|
||||
"nbformat": 4,
|
||||
"nbformat_minor": 0
|
||||
}
|
||||
211
sorting_searching/quick-sort.ipynb
Normal file
211
sorting_searching/quick-sort.ipynb
Normal file
@@ -0,0 +1,211 @@
|
||||
{
|
||||
"cells": [
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://bit.ly/code-notes).</i></small>"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Problem: Implement quick sort.\n",
|
||||
"\n",
|
||||
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
|
||||
"* [Test Cases](#Test-Cases)\n",
|
||||
"* [Algorithm](#Algorithm)\n",
|
||||
"* [Code](#Code)\n",
|
||||
"* [Unit Test](#Unit-Test)\n",
|
||||
"* [Pythonic-Code](#Pythonic-Code)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Constraints and Assumptions\n",
|
||||
"\n",
|
||||
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
|
||||
"\n",
|
||||
"* Are you looking for a naiive solution (ie not in-place)?\n",
|
||||
" * Yes"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Test Cases\n",
|
||||
"\n",
|
||||
"* Empty input\n",
|
||||
"* One element\n",
|
||||
"* Two or more elements"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Algorithm\n",
|
||||
"\n",
|
||||
"Wikipedia's animation:\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"* Set pivot to the middle element in the data\n",
|
||||
"* For each element:\n",
|
||||
" * If current element is the pivot, continue\n",
|
||||
" * If the element is less than the pivot, add to left array\n",
|
||||
" * Else, add to right array\n",
|
||||
"* Recursively apply quicksort to the left array\n",
|
||||
"* Recursively apply quicksort to the right array\n",
|
||||
"* Merge the left array + pivot + right array\n",
|
||||
"\n",
|
||||
"Complexity:\n",
|
||||
"* Time: O(n log(n)) average, best, O(n^2) worst\n",
|
||||
"* Space: O(n), n extra space, n recursion depth, generally not stable"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Code"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 1,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"def quick_sort(data):\n",
|
||||
" if len(data) < 2:\n",
|
||||
" return data\n",
|
||||
" left = []\n",
|
||||
" right = []\n",
|
||||
" pivot_index = len(data) / 2\n",
|
||||
" pivot_value = data[pivot_index]\n",
|
||||
" for i in xrange(0, len(data)):\n",
|
||||
" if i == pivot_index:\n",
|
||||
" continue\n",
|
||||
" if data[i] < pivot_value:\n",
|
||||
" left.append(data[i])\n",
|
||||
" else:\n",
|
||||
" right.append(data[i])\n",
|
||||
" left = quick_sort(left)\n",
|
||||
" right = quick_sort(right)\n",
|
||||
" return left + [pivot_value] + right"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Pythonic-Code\n",
|
||||
"\n",
|
||||
"From http://stackoverflow.com/questions/18262306/quick-sort-with-python"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 2,
|
||||
"metadata": {
|
||||
"collapsed": true
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"def quick_sort_alt(arr): \n",
|
||||
" if len(arr) <= 1:\n",
|
||||
" return arr\n",
|
||||
" else:\n",
|
||||
" return quick_sort_alt([x for x in arr[1:] if x<arr[0]]) + [arr[0]] + quick_sort_alt([x for x in arr[1:] if x>=arr[0]])"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Unit Test\n",
|
||||
"\n",
|
||||
"*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand. You generally will not be asked to write a unit test like what is shown below.*"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 3,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [
|
||||
{
|
||||
"name": "stdout",
|
||||
"output_type": "stream",
|
||||
"text": [
|
||||
"Empty input\n",
|
||||
"One element\n",
|
||||
"Two or more elements\n",
|
||||
"Success: test_quick_sort\n",
|
||||
"\n",
|
||||
"Empty input\n",
|
||||
"One element\n",
|
||||
"Two or more elements\n",
|
||||
"Success: test_quick_sort\n",
|
||||
"\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"from nose.tools import assert_equal\n",
|
||||
"\n",
|
||||
"class Test(object):\n",
|
||||
" def test_quick_sort(self, func):\n",
|
||||
" print('Empty input')\n",
|
||||
" data = []\n",
|
||||
" func(data)\n",
|
||||
" assert_equal(data, [])\n",
|
||||
"\n",
|
||||
" print('One element')\n",
|
||||
" data = [5]\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, -1]\n",
|
||||
" data = func(data)\n",
|
||||
" assert_equal(data, sorted(data))\n",
|
||||
" \n",
|
||||
" print('Success: test_quick_sort\\n')\n",
|
||||
"\n",
|
||||
"if __name__ == '__main__':\n",
|
||||
" test = Test()\n",
|
||||
" test.test_quick_sort(quick_sort)\n",
|
||||
" test.test_quick_sort(quick_sort_alt)"
|
||||
]
|
||||
}
|
||||
],
|
||||
"metadata": {
|
||||
"kernelspec": {
|
||||
"display_name": "Python 2",
|
||||
"language": "python",
|
||||
"name": "python2"
|
||||
},
|
||||
"language_info": {
|
||||
"codemirror_mode": {
|
||||
"name": "ipython",
|
||||
"version": 2
|
||||
},
|
||||
"file_extension": ".py",
|
||||
"mimetype": "text/x-python",
|
||||
"name": "python",
|
||||
"nbconvert_exporter": "python",
|
||||
"pygments_lexer": "ipython2",
|
||||
"version": "2.7.10"
|
||||
}
|
||||
},
|
||||
"nbformat": 4,
|
||||
"nbformat_minor": 0
|
||||
}
|
||||
205
sorting_searching/selection-sort.ipynb
Normal file
205
sorting_searching/selection-sort.ipynb
Normal file
@@ -0,0 +1,205 @@
|
||||
{
|
||||
"cells": [
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://bit.ly/code-notes).</i></small>"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Problem: Implement selection sort.\n",
|
||||
"\n",
|
||||
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
|
||||
"* [Test Cases](#Test-Cases)\n",
|
||||
"* [Algorithm](#Algorithm)\n",
|
||||
"* [Code](#Code)\n",
|
||||
"* [Unit Test](#Unit-Test)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Constraints and Assumptions\n",
|
||||
"\n",
|
||||
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
|
||||
"\n",
|
||||
"* Are you looking for a naiive solution (ie not stable, not based on a heap)?\n",
|
||||
" * Yes"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Test Cases\n",
|
||||
"\n",
|
||||
"* Empty input\n",
|
||||
"* One element\n",
|
||||
"* Two or more elements"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Algorithm\n",
|
||||
"\n",
|
||||
"Wikipedia's animation:\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"We can do this recursively or iteratively. Iteratively will be more efficient as it doesn't require the extra space overhead with the recursive calls.\n",
|
||||
"\n",
|
||||
"* For each element\n",
|
||||
" * Check every element to the right to find the min\n",
|
||||
" * 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"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Code"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 1,
|
||||
"metadata": {
|
||||
"collapsed": true
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"def find_min_index(data, start):\n",
|
||||
" min_index = start\n",
|
||||
" for i in xrange(start + 1, len(data)):\n",
|
||||
" if data[i] < data[min_index]:\n",
|
||||
" min_index = i\n",
|
||||
" return min_index\n",
|
||||
"\n",
|
||||
"def swap(data, i, j):\n",
|
||||
" if (i != j):\n",
|
||||
" data[i], data[j] = data[j], data[i]"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 2,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"def selection_sort_recursive(data, start=0):\n",
|
||||
" if start < len(data) - 1:\n",
|
||||
" swap(data, start, find_min_index(data, start))\n",
|
||||
" selection_sort_recursive(data, start+1)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 3,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"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",
|
||||
" swap(data, i, find_min_index(data, i))"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Unit Test\n",
|
||||
"\n",
|
||||
"*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand. You generally will not be asked to write a unit test like what is shown below.*"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 4,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [
|
||||
{
|
||||
"name": "stdout",
|
||||
"output_type": "stream",
|
||||
"text": [
|
||||
"Empty input\n",
|
||||
"One element\n",
|
||||
"Two or more elements\n",
|
||||
"Success: test_selection_sort\n",
|
||||
"\n",
|
||||
"Empty input\n",
|
||||
"One element\n",
|
||||
"Two or more elements\n",
|
||||
"Success: test_selection_sort\n",
|
||||
"\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"from nose.tools import assert_equal\n",
|
||||
"\n",
|
||||
"class Test(object):\n",
|
||||
" def test_selection_sort(self, func):\n",
|
||||
" print('Empty input')\n",
|
||||
" data = []\n",
|
||||
" func(data)\n",
|
||||
" assert_equal(data, [])\n",
|
||||
"\n",
|
||||
" print('One element')\n",
|
||||
" data = [5]\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, -1]\n",
|
||||
" func(data)\n",
|
||||
" assert_equal(data, sorted(data))\n",
|
||||
" \n",
|
||||
" print('Success: test_selection_sort\\n')\n",
|
||||
"\n",
|
||||
"if __name__ == '__main__':\n",
|
||||
" test = Test()\n",
|
||||
" test.test_selection_sort(selection_sort_recursive)\n",
|
||||
" test.test_selection_sort(selection_sort_iterative)"
|
||||
]
|
||||
}
|
||||
],
|
||||
"metadata": {
|
||||
"kernelspec": {
|
||||
"display_name": "Python 2",
|
||||
"language": "python",
|
||||
"name": "python2"
|
||||
},
|
||||
"language_info": {
|
||||
"codemirror_mode": {
|
||||
"name": "ipython",
|
||||
"version": 2
|
||||
},
|
||||
"file_extension": ".py",
|
||||
"mimetype": "text/x-python",
|
||||
"name": "python",
|
||||
"nbconvert_exporter": "python",
|
||||
"pygments_lexer": "ipython2",
|
||||
"version": "2.7.10"
|
||||
}
|
||||
},
|
||||
"nbformat": 4,
|
||||
"nbformat_minor": 0
|
||||
}
|
||||
0
sorting_searching/tests/__init__.py
Normal file
0
sorting_searching/tests/__init__.py
Normal file
Reference in New Issue
Block a user