Items related to The classic original textual data structures and algorithms...

The classic original textual data structures and algorithms analysis: Java language description (English version 3)(Chinese Edition) - Softcover

( MEI ) Mark Allen Weiss

 
9787111412366: The classic original textual data structures and algorithms analysis: Java language description (English version 3)(Chinese Edition)

Synopsis

《经典原版书库·数据结构与算法分析:Java语言描述(英文版·第3版)》是国外数据结构与算法分析方面的经典教材,使用卓越的Java编程语言作为实现工具讨论了数据结构(组织大量数据的方法)和算法分析(对算法运行时间的估计)。随着计算机速度的不断增加和功能的日益强大,人们对有效编程和算法分析的要求也不断增长。《经典原版书库·数据结构与算法分析:Java语言描述(英文版·第3版)》将算法分析与最有效率的Java程序的开发有机地结合起来,深入分析每种算法,并细致讲解精心构造程序的方法,内容全面、缜密严格。SupposeyouhaveagroupofNnumbersandwouldliketodeterminethethhlargest.Thisisknownastheselectionproblem.MoststudencswhohavehadaprogrammingcourseortwowouldhavenodifficultywritingaprogramCosolvet.hisproblem.Therearequiteafew"obvious"solutions.OnewaytosolvethisproblemwouldbetoreadtheNnumbersintoanarray,sortthearrayindecreasingorderbysomesimplealgorithmsuchasbubblesort,andthenreturntheelememinposkionk.Asomewhatbetteralgorithmmightbetoreadthefirstkelementsintoanarrayandsortthem(indecreasingorder).Next,eachremainingelementisreadonebyone.Asanewelementarrives,itisignoredifitissmallerthanthekthelementinthearray.Otherwise,itisplacedinitscorrectspotinthearray,bumpingoneelementoutofthearray.WhenthealgPo'ithmends,theelement.inthekthpositionisret.urnedastheanswer.Bothalgorit.hmsaresimpletocode,andyouareencouragedtodoso.Thenaturalquestions,then,arewhichalgorithmisbetterand,moreimportant,iseitheralgorithmgoodenough?Asimulationusingarandomfileof30millionelementsandk=l5,000,000willshowthatneitheralgorithmfinishesinareasonableamountoftime;eachrequiresseveraldaysofcompurerprocessingtocerm

"synopsis" may belong to another edition of this title.