[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)

[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)

ID:13146721

大小:59.00 KB

页数:32页

时间:2018-07-20

[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)_第1页
[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)_第2页
[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)_第3页
[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)_第4页
[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)_第5页
资源描述:

《[郝斌老师]自学数据结构大纲笔记([hao bin teacher] self-study data structure outline notes)》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、[郝斌老师]自学数据结构大纲笔记([Haobinteacher]self-studydatastructureoutlinenotes)Datastructureoverview(teachingmaterialsselectedYanYuminandWuWeimin,thebookprogramispseudoalgorithmTheconcreteprocedureisonewhere,West,Daniel,onlyProgram.ThereisabookwrittenbyHuangGuoyu

2、ofTaiwanhimselfOnlythinking,theprogramisanothercowrittenbyQinghuaUnfortunately,alotofwrongAfteryouhavelearnedthedatastructure,youwillhaveadeeperunderstandingoftheprocessfunctionsDefinitionHowdoweputalargenumberofcomplexproblemsinrealityintospecificdata

3、types?Howdoyoustoredata?Andspecificstoragestructures(personalrelationships)Savetothemainmemory(memory),andonthisbasis,toimplementafunction(suchassearchingforanelement,deletinganelement,sortingallelements)Andthecorrespondingoperation,thecorrespondingope

4、rationisalsocalledalgorithm.Forexample,inclass15people,theamountofinformationmaybeanarrayonit,butif10000,WhatshouldIdo?Memorymaynothavesomanycontiguousspaces,sowe'llusethelinkedlist,Yousee,thatistodowithstorage.Anotherexampleistheinformationstorageofth

5、epersonnelmanagementsystem,Becauseoftheexistenceofupperandlowerlevels,arraysandlinkedlistsarepowerless,Atthistimeweusetrees,andthen,forexample,whatwedoisatrafficmap.ThestationandthestationmustbeconnectedThere'snothingmorewecandoaboutstorage,sowe'vegott

6、hemapagain.chartThatis,eachnodecancommunicatewithothernodes.SowhenwehavetosolveThefirstthingtosolveishowtoconverttheseproblemsintodataandsavethemfirstIntoourmainmemory.)Datastructure=individual+individualrelationAlgorithm=theoperationofstoringdataalgor

7、ithmMethodsandstepsofproblemsolvingStandardformeasuringalgorithms1,timecomplexityThenumberoftimesaprogramwillexecute,notthetimeittakestoexecuteit.2,spacecomplexityThemaximummemoryoccupiedbythealgorithmduringexecution3,thedegreeofdifficulty(mainlyinterm

8、sofapplicationvalue)4,robustness(notsomeoneelsetoanillegalinputwillhangup)StatusofdatastructureDatastructureisthecoreofsoftwarecoursesProgram=datastorage+dataoperations+languagethatcanbeexecutedbythecomputer(alreadyavailable)Afterlearni

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。