| Title | Reduction of Pairing to Sorting |
| Catalog Type | SLCItem |
| Persistent ID | https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/pairToSortCON.html |
| Platform Name | OpenDSA |
| Features | Presentation |
| Description | Slideshow showing a reduction of Pairing to Sorting. This demonstrates that the upper bound for Pairing is the same as the upper bound for Sorting. So, a standard 'software engineering' form of code reuse. |
| Keywords | Reduction |
| Author | Nabanita Maji, Cliff Shaffer |
| Institution | Virginia Tech |
| Iframe URL | https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/pairToSortCON.html |
| Protocol | LTI 1.1, SPLICE |
| Protocol URL | |
| License | https://github.com/OpenDSA/OpenDSA/blob/master/MIT-license.txt |
| Programming Language | N/A |
| Natural Language | en |