文件名称:xianxingbiao
介绍说明－－下载内容均来自于网络，请自行研究使用
1. 实现顺序表的基本操作，包括顺序表的初始化、第i个元素前插入一个新的元素、删除第i个元素、查找某元素、顺序表的销毁，顺序表的清空。
2. 写一个函数，建立并显示含有n个整数的顺序表
3. 写一个函数，实现对有序表（非递减）插入一个元素的功能
4. 写一个函数，实现两个有序（非递减）表合并生成新的有序表的功能
5. 编写一个界面友好的测试程序，能够对各种边界条件进行测试，验证上述算法的正确性。
-1 in order to achieve the basic operation of the table, including the initialization sequence table, the i-th element before inserting a new element, delete the i-th element, find an element, the destruction of the order form, order form emptied.
(2) Write a function that creates and displays the sequence contains n integers table
3 Write a function to achieve the ordered list (non-decreasing) function of inserting an element
4 Write a function to achieve two ordered (non-decreasing) combined to generate a new table ordered list of functions
5 write a user-friendly test procedure that can be tested for various boundary conditions, verify the correctness of the algorithm.
2. 写一个函数，建立并显示含有n个整数的顺序表
3. 写一个函数，实现对有序表（非递减）插入一个元素的功能
4. 写一个函数，实现两个有序（非递减）表合并生成新的有序表的功能
5. 编写一个界面友好的测试程序，能够对各种边界条件进行测试，验证上述算法的正确性。
-1 in order to achieve the basic operation of the table, including the initialization sequence table, the i-th element before inserting a new element, delete the i-th element, find an element, the destruction of the order form, order form emptied.
(2) Write a function that creates and displays the sequence contains n integers table
3 Write a function to achieve the ordered list (non-decreasing) function of inserting an element
4 Write a function to achieve two ordered (non-decreasing) combined to generate a new table ordered list of functions
5 write a user-friendly test procedure that can be tested for various boundary conditions, verify the correctness of the algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
xianxingbiao.cpp