文件名称:11
- 所属分类:
- 数据结构常用算法
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 769kb
- 下载次数:
- 0次
- 提 供 者:
- we***
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出,可右键点击选“另存为”。
失败请重下,重下不扣分。
如迅雷强制弹出,可右键点击选“另存为”。
失败请重下,重下不扣分。
介绍说明--下载内容均来自于网络,请自行研究使用
1、设线性表存放在向量A[arrsize]的前elenum个分量中,且递增有序。试设计一算法,将x插入到线性表的适当位置上,以保持线性表的有序性。
2、用向量作存储结构,试设计一个算法,仅用一个辅助结点,实现将线性表中的结点循环右移k位的运算。
3、用向量作存储结构,试设计一个算法,仅用一个辅助结点,实现将线性表逆置的运算。
-1, a set of linear table stored in the vector A [arrsize] the former elenum components and incremental orderly. Try to design an algorithm, x is inserted into the appropriate position of the linear form, in order to maintain the orderliness of the linear form of the. 2, with the vector storage structure, try to design an algorithm, with only a secondary node, linear in k-bit computing node rotate right. 3 vector for the storage structure, and try to design an algorithm, only a secondary node, inverse linear table set computing.
2、用向量作存储结构,试设计一个算法,仅用一个辅助结点,实现将线性表中的结点循环右移k位的运算。
3、用向量作存储结构,试设计一个算法,仅用一个辅助结点,实现将线性表逆置的运算。
-1, a set of linear table stored in the vector A [arrsize] the former elenum components and incremental orderly. Try to design an algorithm, x is inserted into the appropriate position of the linear form, in order to maintain the orderliness of the linear form of the. 2, with the vector storage structure, try to design an algorithm, with only a secondary node, linear in k-bit computing node rotate right. 3 vector for the storage structure, and try to design an algorithm, only a secondary node, inverse linear table set computing.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
实验1\Debug
.....\.....\p1.exe
.....\.....\p1.ilk
.....\.....\p1.pch
.....\.....\p1.pdb
.....\.....\vc60.idb
.....\.....\vc60.pdb
.....\p1.cpp
.....\p1.dsp
.....\p1.dsw
.....\p1.ncb
.....\p1.opt
.....\p1.plg