文件名称:22
- 所属分类:
- 数据结构常用算法
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 2.8mb
- 下载次数:
- 0次
- 提 供 者:
- we***
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
1、已知带头结点的动态单链表L中的结点是按整数值递增排序的,试写一算法将值为x的结点插入到表L中,使L仍然有序。
2、设计一算法,逆置带头结点的动态链表L。要求利用原表的结点空间,并要求用尽可能少的时间完成。
3、假设有两个按元素值递增有序的线性表A和B,均以单链表作存储结构,试编写算法将A表和B表归并成一个按元素值递减有序的线性表C,并要求利用原表的空间存放C。
-1, the node is known to take the lead in junction dynamic single list L Ascending integer value, trial writing an algorithm to the junction point of the value x is inserted into the table L, so that L remains orderly. 2, the design of an algorithm, the inverse is set to take the lead junction dynamic list L. Require the use of a node of the original table space, and require as little time as possible to complete. 3, assuming two increments ordered linear element values in Table A and B are single linked list for storage structures, try to write algorithms to Table A and Table B merge into a descending order linear element values table C, and requires the use of the storage space of the original table C.
2、设计一算法,逆置带头结点的动态链表L。要求利用原表的结点空间,并要求用尽可能少的时间完成。
3、假设有两个按元素值递增有序的线性表A和B,均以单链表作存储结构,试编写算法将A表和B表归并成一个按元素值递减有序的线性表C,并要求利用原表的空间存放C。
-1, the node is known to take the lead in junction dynamic single list L Ascending integer value, trial writing an algorithm to the junction point of the value x is inserted into the table L, so that L remains orderly. 2, the design of an algorithm, the inverse is set to take the lead junction dynamic list L. Require the use of a node of the original table space, and require as little time as possible to complete. 3, assuming two increments ordered linear element values in Table A and B are single linked list for storage structures, try to write algorithms to Table A and Table B merge into a descending order linear element values table C, and requires the use of the storage space of the original table C.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
实验3\1
.....\.\Cpp1.cpp
.....\.\Cpp1.dsp
.....\.\Cpp1.dsw
.....\.\Cpp1.ncb
.....\.\Cpp1.opt
.....\.\Cpp1.plg
.....\.\Debug
.....\.\.....\Cpp1.exe
.....\.\.....\Cpp1.ilk
.....\.\.....\Cpp1.obj
.....\.\.....\Cpp1.pch
.....\.\.....\Cpp1.pdb
.....\.\.....\vc60.idb
.....\.\.....\vc60.pdb
.....\2
.....\.\Cpp1.cpp
.....\.\Cpp1.dsp
.....\.\Cpp1.dsw
.....\.\Cpp1.ncb
.....\.\Cpp1.opt
.....\.\Cpp1.plg
.....\.\Debug
.....\.\.....\Cpp1.exe
.....\.\.....\Cpp1.ilk
.....\.\.....\Cpp1.obj
.....\.\.....\Cpp1.pch
.....\.\.....\Cpp1.pdb
.....\.\.....\vc60.idb
.....\.\.....\vc60.pdb
.....\3
.....\.\Cpp2.cpp
.....\.\Cpp2.dsp
.....\.\Cpp2.dsw
.....\.\Cpp2.ncb
.....\.\Cpp2.opt
.....\.\Cpp2.plg
.....\.\Debug
.....\.\.....\Cpp2.exe
.....\.\.....\Cpp2.ilk
.....\.\.....\Cpp2.obj
.....\.\.....\Cpp2.pch
.....\.\.....\Cpp2.pdb
.....\.\.....\vc60.idb
.....\.\.....\vc60.pdb
.....\.\新建文件夹
.....\.\..........\Cpp2.cpp
.....\.\..........\Cpp2.dsp
.....\.\..........\Cpp2.dsw
.....\.\..........\Cpp2.ncb
.....\.\..........\Cpp2.opt
.....\.\..........\Cpp2.plg
.....\.\..........\Debug
.....\.\..........\.....\Cpp2.exe
.....\.\..........\.....\Cpp2.ilk
.....\.\..........\.....\Cpp2.obj
.....\.\..........\.....\Cpp2.pch
.....\.\..........\.....\Cpp2.pdb
.....\.\..........\.....\vc60.idb
.....\.\..........\.....\vc60.pdb
.....\DoubleList.cpp