COEN 179 Lecture Notes - Lecture 9: Candela, Computational Complexity Theory, Selection Sort

• School: Santa Clara University
• Department: Computer Engineering
• Course: COEN 179
• Professor: Tran

Document Summary

Coen 179 lecture 9 decrease & conquer notes. Another easy way to understand or implement design strategy. Based on belief that solution to instance of size n can be built on solution to instance of smaller size such as n - 1. Instance : specific input to a problem . { 30104,23 is an instance of sorting of: 9 size 4 . Fact cn ) = 1*2*1 : 9 . mm. =d multiplicities men ) = # of return * reactants;mn%tyhi return is. Input : army aco . output : smallest element in n -i] , n ii. 3,4 , 225 a mink, 17=1 mm min -2. Mined ( aco . n -i] ) { itch - =d return acotj temp = min el (aco . return ( temp ca cn -it ) ? temp : ach -if h -2t i. } analysis : ccny = # a array comparisons. Cen ) = ccn -d th , h 71.