c语言冒泡、插入法、选择排序算法分析（analysis of bubble insertion method and sorting algorithm in c language）

《c语言冒泡、插入法、选择排序算法分析（analysis of bubble insertion method and sorting algorithm in c language）》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、c语言冒泡、插入法、选择排序算法分析（AnalysisofbubbleinsertionmethodandsortingalgorithminClanguage）AnalysisofthreecommonsortingalgorithmsinClanguageOne,bubblemethod(foamingmethod)Algorithmrequirements:usethebubblemethodtosort10integersinascendingorder.Algorithmanalysis:iftherearennumbers,n-1timesarecompared.Int

2、hefirstcomparison,n-1times22oftheadjacentelementsarecompared,andinthejcomparison,n-jtimes22arecompared.Comparisonofthesequencefromfronttoback,afteracomparison,thebottomvalue(changetothelastelementposition),themaximumsinktoascending,minimumbottomisdescending.Algorithmsourcecode:#include

3、>(main){Int,a[10],I,J,t;Printf("Pleaseinput10numbers:");/**/datainputsourceFor(i=0;i<10;i++)Scanf("%d",&a[i]);/**/sortFor(j=0;j<9;j++)/*outerloopcontrolsortingseveraltimes,thenumberofrowsofn-1times/nFor(i=0;i<9-j;i++)/*internalcirculationpertripcomparedtothenumberofJtimesn-jtimescompared.If(a[

4、i]>a[i+1])betweenadjacentelementsisreverseexchange/**/.{t=a[i];A[i]=a[i+1];A[i+1]=t;}/**/outputsortresultsPrintf("Thesortednumbers:");For(i=0;i<10;i++)Printf("%d",a[i]);Printf("");}Thealgorithmfeatures:comparisonofadjacentelements22,eachtripwillsinktothebottomofthemostvaluepositionofanumbero

5、fresults,determinetheelementpositionofthesequenceisfromtheback,theotherelementsmayberelativepositionadjustment.Sortingcanbedoneinascendingordescendingorder.Algorithmanalysis:definetheN-1subcycle,eachnumberisn-jtimes,comparethepreviousnumberandthenumberofthelatter.Thenexchangeorder.Two,selectio

6、nmethodAlgorithmrequirements:theselectionmethodfor10integersindescendingorder.Algorithmanalysis:eachrowselectsoneofthemostvalueandunorderedsequenceofthefirstnumberofexchanges,nnumberofn-1election.LineIassumesthatIisthehighestvalueindex,andthencomparesthemaximumvaluewiththelastnumberofi+1,andfi

7、ndsthemostvaluableindex.Ifthehighestindexisnottheinitialvalue,theelementofthemaximumvalueisexchangedwiththeelementwhoseindexisI.Algorithmsourcecode:#include(main){Int,a[10],I,J,K,t,n=10;Printf("Pleaseinput10numbers:");For(i=0;i