StarMirror/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges.git synced 2024-03-22 13:11:13 +08:00
Code Issues Projects Releases Wiki Activity

Tweaked selection sort challenge.

Browse Source
This commit is contained in:
Donne Martin 2015-07-03 20:08:23 -04:00
parent 9eb9ed637a
commit a5b7673e75
2 changed files with 32 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
sorting_searching/selection_sort/selection_sort_challenge.ipynb
View File

@ -4,7 +4,14 @@
"cell_type": "markdown", "cell_type": "markdown",
"metadata": {}, "metadata": {},
"source": [ "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>" "<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/coding-challenges).</i></small>"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Challenge Notebook"
] ]
}, },
{ {
@ -17,7 +24,8 @@
"* [Test Cases](#Test-Cases)\n", "* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n", "* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n", "* [Code](#Code)\n",
"* [Unit Test](#Unit-Test)" "* [Unit Test](#Unit-Test)\n",
"* [Solution Notebook](#Solution-Notebook)"
] ]
}, },
{ {
@ -26,7 +34,7 @@
"source": [ "source": [
"## Constraints\n", "## Constraints\n",
"\n", "\n",
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n", "*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n", "\n",
"* Is a naiive solution sufficient (ie not stable, not based on a heap)?\n", "* Is a naiive solution sufficient (ie not stable, not based on a heap)?\n",
" * Yes" " * Yes"
@ -49,7 +57,7 @@
"source": [ "source": [
"## Algorithm\n", "## Algorithm\n",
"\n", "\n",
"Refer to the solution notebook. If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start." "Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/selection_sort/selection_sort_solution.ipynb). If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start."
] ]
}, },
{ {
@ -91,7 +99,7 @@
"source": [ "source": [
"## Unit Test\n", "## Unit Test\n",
"\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.*\n", "\n",
"\n", "\n",
"**The following unit test is expected to fail until you solve the challenge.**" "**The following unit test is expected to fail until you solve the challenge.**"
] ]
@ -141,6 +149,15 @@
"if __name__ == '__main__':\n", "if __name__ == '__main__':\n",
" main()" " main()"
] ]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Solution Notebook\n",
"\n",
"Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/coding-challenges/blob/master/sorting_searching/selection_sort/selection_sort_solution.ipynb) for a discussion on algorithms and code solutions."
]
} }
], ],
"metadata": { "metadata": {

14
sorting_searching/selection_sort/selection_sort_solution.ipynb
View File

@ -4,7 +4,14 @@
"cell_type": "markdown", "cell_type": "markdown",
"metadata": {}, "metadata": {},
"source": [ "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>" "<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/coding-challenges).</i></small>"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Solution Notebook"
] ]
}, },
{ {
@ -26,7 +33,7 @@
"source": [ "source": [
"## Constraints\n", "## Constraints\n",
"\n", "\n",
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n", "*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
"\n", "\n",
"* Is a naiive solution sufficient (ie not stable, not based on a heap)?\n", "* Is a naiive solution sufficient (ie not stable, not based on a heap)?\n",
" * Yes" " * Yes"
@ -124,8 +131,7 @@
"metadata": {}, "metadata": {},
"source": [ "source": [
"## Unit Test\n", "## Unit Test\n",
"\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.*"
] ]
}, },
{ {