-
Data-structure
数据结构的一些简单的排序算法,有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)
- 2016-06-28 08:27:32下载
- 积分:1
-
xuanzexingjiegou
选择型结构c语言编程 (Choose the type of structure of C language programming)
- 2013-09-24 22:11:37下载
- 积分:1
-
fibonaqi
说明: 斐波那契 式子计算,属于算法类的
用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)
- 2011-04-07 09:10:16下载
- 积分:1
-
eightqueen
利用數據結構中的棧,實現19世紀著名數學家高斯提出的八皇后問題(Stack data structure, to achieve the eight queens problem of the 19th century, the famous mathematician Gauss)
- 2012-10-23 08:30:21下载
- 积分:1
-
BigNumeberOperator
这是高精度大数运算的源码,对于大于64位的整形数字的四则运算,是万能的啊……(This is the code of big number s operator.)
- 2011-08-09 15:25:09下载
- 积分:1
-
xianxinglianbiao
c语言编写链式线性表的初始化,创建,插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
- 2013-11-09 14:30:30下载
- 积分:1
-
binary-search
此代码为折半查找算法,适用于有序表,欢迎各位下载(This code is the binary search algorithm for ordered lists
)
- 2011-07-06 15:50:17下载
- 积分:1
-
qiuhe
多项式求和,用链表实现的一元多项式求和程序,比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)
- 2011-09-15 09:16:38下载
- 积分: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
-
complex
.h文件。c++中的复数类,能够直接完成基本四则运算,输入输出流,完成一定范围内的比较运算(. H file. c++ classes in the plural, to directly perform basic arithmetic, input and output streams, to complete a range of comparison operators)
- 2021-04-25 14:58:46下载
- 积分:1