搜索资源列表
4-SHIBAI
- c语言，求解五届龙哥库塔方程。用指针数组所做。很好.-c language, for five Mangge Cucuta equation. Done by a pointer array. Good.
gauss2.c
- Using Gaussian elimination to solve linear equations. // In this version, we allow matrix of any size. This is done by treating // the name of a 2-dimensional array as pointer to the beginning of the // array. This makes use of the fact that ar
average_point
- 一个vc++的求平均值的小例子，用到了指针，和多种函数-A vc++ Average for the small examples used for the pointer, and a variety of functions
nni
- 计算n阶矩阵的逆矩阵的函数，输入表示矩阵的指针和阶数，然后计算输出逆矩阵的指针，附带矩阵乘法检测结果-Calculation of n-order matrix inverse matrix function, enter the matrix express the pointer and order, and then calculating the inverse matrix of output indicators, with matrix multiplication test re
operatorPointer
- Operator pointer in C
Hash_Table1616057162003
- A hash table that stores key/pointer pairs. The table can handle either numbers or strings as keys, you specify which type it is when you create it. When you use strings as the keys, you should store the key permanently yourself somewhere, such as in
Matrixoperations
- 求一个矩阵的最大值，最小值及平均值，用行指针实现相应算法。-Seek a matrix of the maximum, minimum and average values, with the line pointer to achieve the appropriate algorithm.
aitkenroot
- 埃特金求解C语言代码 //函数名：aitkenroot //功能描述：求出[a,b]区间内的非线性方程f(x)的一个实根 //输入参数：*x0（指向迭代初值和终值的指针） // f（迭代函数） // eps（精度要求） // max（最大迭代次数） //返回值：0（迭代失败），1（迭代成功）-Aitken Solution C language code// function name: aitkenroot// Function Descr iption: Fin
Bin_Tree
- Write efficient functions (and give their Big-Oh running times)that take a pointer to a binary tree root T and compute: a.The number of leaves of T b.The number of nodes in T that contain one non-NULL child c.The number of nodes in T that co
FFT-Algorithm
- 本例通过VC实现二维快速傅里叶变换，涉及到进行矩阵、复数等数学运算，运用了C语言动态内存分配、文件操作、结构指针的函数调用等内容。-In this case through the VC to achieve two-dimensional fast Fourier transform, related to the matrix, such as complex mathematics, use the C language, dynamic memory allocation, file o
Bezier
- A simple application/algorithm to implement Bezier Curve using Turbo C/C++ for DOS using mouse pointer.
na7
- Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 -Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m poin
c-P-P-algorithm-procedures
- 程序开始运行，要求用户首先输入两个大数。 然后进行菜单选择，进行相应的大数运算。 分析说明：由于大数的范围太大，不能直接定义为int或者float等， 所以我们的想法就是定义成字符串类型， 输入的数字一位一位地存入字符数组里面。 然后在运算的时候也是一位一位地运算。 这个过程就得从最基本的数学运算法则做起，不乏多种判断。 涉及到数组和指针的应用。最难的就是判断情 况还有应用数组和指针过程中出现的多种未可预知的错误， 还得通过逐步调试慢慢找出。我们先从加减
Sorting-linked-lists
- Sorting linked list. With only one direction pointer
test2
- 已知两个函数 ，求它们在指定区间的定积分，要求用矩形法编制求解定积分的通用函数（函数中可用函数型参数或函数指针型参数）。-The known two function, let them in the designated the definite integral interval, the requirement with rectangle method of the definite integral solution of general function (function type
Ex6_13
- 【例6.13】梯形法求积分的函数integer()是通用函数，可求任一函数的定积分。不同的函数有不同的解析式， //该解析式决定了自变量在每一个小积分区间端点处的函数值。函数 integer()以一个指向函数的指针为参数， //由该参数调用欲求定积分的函数，另两个参数是积分上下限。-[Example 6.13] the trapezoidal method to seek the integral function integer () is a universal function,
SDAFGDFHFDG
- 题目：编写一个函数，输入n为偶数时，调用函数求1/2+1/4+...+1/n,当输入n为奇数时，调用函数 1/1+1/3+...+1/n(利用指针函数) 1.程序分析： 2.程序源代码：-Topic: write a function, input n is even, a function call for 1/2+ 1/4+...+ 1/n, when the input n an odd number, a function call 1/1+ 1/3+...+ 1
average
- 计算一组学生的平均成绩和不及格人数。用结构指针变量作函数参数编程。-Computing the grade point average of a group of students and the number of passes. Structure pointer variable as a function of the parameter programming.
main
- 计算两个任意矩阵的乘积，包括了动态分配内存，指针等知识点-Calculation of two arbitrary matrices, including the knowledge of the dynamic allocation of memory, the pointer points
6
- 编写一个函数，输入n为偶数时，调用函数求1/2+1/4+...+1/n,当输入n为奇数时，调用函数1/1+1/3+...+1/n(利用指针函数)。 -Write a function, the input n is even, the call function evaluation 1/2+1/4+...+ 1/n, when the input n is odd, call the function 1/1+1/3+...+ 1/n (using the pointer function