| Title | Practicing quick sort algorithm |
| Catalog Type | SLCItem |
| Persistent ID | https://adapt2.sis.pitt.edu/acos/pitt/jsparsons/jsparsons-python/ps?example-id=ps_python_quick_sorting |
| Platform Name | jsParsons |
| Features | — |
| Description | Construct a function that implements quick sort algorithm. The partition() function has been pre defined and displayed below.<br/>Consider data is a list, first is the first element's index and last is the last element's index |
| Keywords | recursion, search algorithms, sorting, sorting algorithms |
| Author | Kamil Akhuseyinoglu |
| Institution | University of Pittsburgh |
| Iframe URL | https://adapt2.sis.pitt.edu/acos/pitt/jsparsons/jsparsons-python/ps?example-id=ps_python_quick_sorting&grp=demo&usr=demo&sid=-1&cid=-1 |
| Protocol | PITT |
| Protocol URL | |
| License | MIT |
| Programming Language | Python |
| Natural Language | en |