王朝网络

分享

 

01.Data Structures with .NET - Part 6: Efficiently Representing Sets
An Extensive Examination of Data StructuresPart 6: Efficiently Representing SetsScott Mitchell4GuysFromRolla.comApril 2004Summary: Scott Mitchell discusses data structures for implementing general and...查看完整版>>Data Structures with .NET - Part 6: Efficiently Representing Sets02.Data Structures with .NET - Part 2: The Queue, Stack, and Hashtable
An Extensive Examination of Data StructuresPart 2: The Queue, Stack, and HashtableScott Mitchell4GuysFromRolla.comNovember 2003 Summary: This article, the second in a six-part series on data structure...查看完整版>>Data Structures with .NET - Part 2: The Queue, Stack, and Hashtable03.Data Structures with .NET - Part 1: An Introduction to Data Structures
An Extensive Examination of Data StructuresPart 1: An Introduction to Data StructuresScott Mitchell4GuysFromRolla.comOctober 2003Summary: This article kicks off a six-part series that focuses on impor...查看完整版>>Data Structures with .NET - Part 1: An Introduction to Data Structures04.Data Structures with .NET - Part 5: From Trees to Graphs
An Extensive Examination of Data StructuresPart 5: From Trees to GraphsScott Mitchell4GuysFromRolla.comMarch 2004Summary: A graph, like a tree, is a collection of nodes and edges, but has no rules dic...查看完整版>>Data Structures with .NET - Part 5: From Trees to Graphs05.Data Structures with .NET - Part 4: Building a Better Binary Search Tree
An Extensive Examination of Data StructuresPart 4: Building a Better Binary Search TreeScott Mitchell4GuysFromRolla.comFebruary 9, 2004Summary: This article, the fourth in the series, begins with a qu...查看完整版>>Data Structures with .NET - Part 4: Building a Better Binary Search Tree06.Data Structures with .NET - Part 3: Binary Trees and BSTs
An Extensive Examination of Data StructuresPart 3: Binary Trees and BSTsScott Mitchell4GuysFromRolla.comJanuary 2004Summary: This article, the third in a six-part series on data structures in the .NET...查看完整版>>Data Structures with .NET - Part 3: Binary Trees and BSTs07.《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(四)
第二章 Searching我觉得既然是仅仅为自己总结，就只抓里面的概要吧，太多了反而不好。主要讲了三种查找的方法:1,list search:顺序查找(sequence search),二分法查找(binary search)2,hashed list search:哈希查找(ha...查看完整版>>《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(四)08.《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(三)
算法效率(Algorithm efficency) 首先提出来算法效率的学习是建立在循环上面的。(The study of algorithm efficency focuses on loops) 1,线形循环(linear loops) 先看一段代码： 1 i=1 2 loop ...查看完整版>>《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(三)09.《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(二)
第一章 简介主要讲述伪码(pseudocode)、抽象数据类型(ADT)、算法效率(efficiency)伪码(pseudocode)：一种类英语结构描述码。举例：algorithm sample(ref pageNumber <integer>)This algorithm reads a file an...查看完整版>>《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(二)10.《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(一)
首先写一下书评吧，我觉得我对语言的学习有两个阶段的跨越比较重要。第一个阶段是在细读谭浩强的《c语言程序设计》的时候理解了指针的概念，让我跳跃了一大步；第二个阶段是在攻读《数据结构（c语言版）》（严蔚敏）...查看完整版>>《数据结构的C++伪码实现》（《DATA STRUCTURES A Pseudocode Approach with C++》）读书笔记(一)

 

 

免责声明：本文为网络用户发布，其观点仅代表作者个人观点，与本站无关，本站仅提供信息存储服务。文中陈述内容未经本站证实，其真实性、完整性、及时性本站不作任何保证或承诺，请读者仅作参考，并请自行核实相关内容。