-
tt0202
1.建立两个有序得链表(带表头,用头插法);
//2.写一算法在单链表上实现线性表的ListLength(L)运算。
写一算法将单链表中值重复的结点删除,使所得的结果表中各结点值均不相同。
(1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
- 2010-09-10 10:26:46下载
- 积分:1
-
xianxingbiaolianjie
线性表的链接实现可利用单链表来实现,每个节点存储一个元素。
利用单链表来实现线性表的元素的插入,删除,修改等功能。
(Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
- 2011-04-26 11:57:25下载
- 积分:1
-
Hanoi
简单的汉诺塔算法,采用归约算法的思想,实例是三个盘子,三个柱子(Simple HANOR algorithm)
- 2012-07-16 20:48:59下载
- 积分:1
-
calculation
数据结构计算算术表达式算法,可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)
- 2010-12-24 13:11:25下载
- 积分:1
-
order
通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)
- 2014-06-08 18:35:10下载
- 积分:1
-
ds3
单向链表的创建与操作
设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作:
(1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。
(源代码:ds3-1.c)
(2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。
(源代码:ds3-2.c)
(3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。
(源代码:ds3-3.c)
(4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。
(源代码:ds3-4.c)
(5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。
(源代码:ds3-5.c)
(6)在给定的单链表的第i位上插入值为n的节点。
(源代码:ds3-6.c)
(7)在给定单链表的值为m的节点的前面插入一个值为n的节点。
(源代码:ds3-7.c)
(Creation and operation of a one-way linked list
Set up a one-way linked list data type node integer data fields , write a function to achieve the following:
( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user .
( Source : ds3-1.c)
( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address.
( Source : ds3-2.c)
( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node .
( Source : ds3-3.c)
( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 .
( Source : ds3-4.c)
( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 .
( Source : ds3-5.c)
( 6 ) )
- 2014-05-11 19:19:41下载
- 积分:1
-
banker
用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)
- 2012-03-13 13:20:43下载
- 积分:1
-
multiplication
本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)
- 2009-05-16 22:04:42下载
- 积分:1
-
binary-tree
数据结构 二叉树的操作,可以对二叉树进行最基本的操作,先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)
- 2012-03-20 21:19:43下载
- 积分:1
-
1
说明: 顺序表的基本操作:1. 编写函数,输入一组整型元素序列,建立一个顺序表。
2. 编写函数,实现对该顺序表的遍历。
3. 编写函数,在顺序表中进行顺序查找某一元素,查找成功则返回其存储位置i,否则返回错误信息。
4. 编写函数,实现在顺序表的第i个位置上插入一个元素x的算法。
5. 编写函数,实现删除顺序表中第i个元素的算法。
6. 编写利用有序表插入算法建立一个有序表的函数。
7. 编写函数,利用以上算法,建立两个非递减有序表,并把它们合并成一个非递减有序表。
8. 编写函数,实现输入一个元素x,把它插入到有序表中,使顺序表依然有序。
9. 编写一个主函数,在主函数中设计一个简单的菜单,分别调试上述算法。
(The basic operation of the order form)
- 2010-06-15 18:15:32下载
- 积分:1