Data Structures with C++ using STL 2E Chapter 3

《Data Structures with C++ using STL 2E Chapter 3》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、1MainIndexContentsSelectionSort(3slides)SelectionSortAlg.(3slides)SearchAlgorithms(6slides)IllustratingtheBinarySearch-Successful(3slides)-Unsuccessful(3slides)BinarySearchAlg.(3slides)Big-ONotationConstantTimeAlgorithmsLinearTimeAlgorithmsExponentialAlgs.(2slides)LogarithmicTimeAlgorithm

2、sChapter3–IntroductiontoAlgorithmsSelectionSortAlgorithm-IntegerVersion-StringVersionTemplateSyntax(4slides)RecursiveDefnofthePowerFncStoppingConditionsfor-RecursiveAlgorithmsImplementingtheRecursive-PowerFunctionTowerofHanoiw/Recursion(3slides)FibonacciNumbersUsing-Iteration(2slides)Summ

3、arySlides(5slides)12MainIndexContentsSelectionSort-5ElementArrayPass0:Scantheentirelistfromarr[0]toarr[4]andidentify20atindex1asthesmallestelement.Exchange20witharr[0]=50,thefirstelementinthelist.23MainIndexContentsSelectionSort-5ElementArrayPass1:Scanthesublist50,40,75,and35.Exchangeth

4、esmallestelement35atindex4witharr[1]=50.34MainIndexContentsSelectionSort-5ElementArrayPass2:Locatethesmallestelementinthesublist40,75,and50.45MainIndexContentsSelectionSort-5ElementArrayPass3:Twoelementsremaintobesorted.Scanthesublist75,50andexchangethesmallerelementwitharr[3].Theexchan

5、geplaces50atindex4inarr[3].56MainIndexContentsSelectionSort-5ElementArray67MainIndexContentsSelectionSortAlgorithmvoidselectionSort(intarr[],intn){intsmallIndex;//indexofsmallest//elementinthesublistintpass,j;inttemp;//passhastherange0ton-278MainIndexContentsSelectionSortAlgorithmfor(pas

6、s=0;pass

7、xandpassarenotthe//samelocation,exchangethe//smallestiteminthesublistwith//arr[pass]if(smallIndex!=pass){temp=arr[pass];arr[pass]=arr[smallIndex];arr[smallIndex]=temp;}}}9SearchAlgorithmsSearchalgorithmsstartwithatargetvalueandemploysomestrategytovisittheelementsloo