Title	Reduction of Pairing to Sorting
Catalog Type	SLCItem
Persistent ID	https://opendsa-server.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/pairToSortCON.html
Platform Name	OpenDSA
Features	Demonstration
Language
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
URL
Author	Nabanita Maji,Cliff Shaffer
Institution	Virginia Tech
Iframe URL	https://opendsa-server.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/pairToSortCON.html
LTI URL
LTI Instructions URL
Protocol	LTI 1.1, SPLICE
Protocol URL	https://opendsa-server.cs.vt.edu/lti/launch?custom_ex_short_name=pairToSortCON&custom_ex_settings=%7B%7D https://opendsa-server.cs.vt.edu/OpenDSA/Metadata/inlineav/NP/pairToSortCON.html
License	https://github.com/OpenDSA/OpenDSA/blob/master/MIT-license.txt
Features	Demonstration
Programming Language	N/A
Natural Language	en