资源列表
[数学计算/工程计算] 2
说明:采用蒙特卡罗法计算pi的近似值,方法是随机产生二维0~1之间的均匀分布数据点,计算落在单位圆内的点与总点数之比就是pi的近似值-Monte Carlo method to calculate the approximation of pi, is randomly generated from 0 to 1 between two-dimensional uniformly distributed data points, the calculation falls within the uni<余坤> 在 2025-06-26 上传 | 大小:2kb | 下载:0
[数学计算/工程计算] pi
说明:刚才传错了……这个才是采用蒙特卡罗法计算pi的近似值的源程序。方法是随机产生二维0~1之间的均匀分布数据点,计算落在单位圆内的点与总点数之比就是pi的近似值-Chuan just wrong ... ... this is the Monte Carlo method to calculate pi approximation of the source. Is randomly generated from 0 to 1 between two-dimensional uniformly di<余坤> 在 2025-06-26 上传 | 大小:2kb | 下载:0
[数学计算/工程计算] gauss_jordan
说明:采用全选主元的高斯—若当方法求矩阵的逆矩阵,矩阵阶数不限但要非奇异,只需在主函数中给出阶数和矩阵各元素即可-Select All PCA using the Gauss- Jordan method for matrix inverse matrix, the matrix order but are not limited to non-singular, just in the main function in the given order and matrix elements can<余坤> 在 2025-06-26 上传 | 大小:2kb | 下载:0
[数据结构常用算法] binarytree
说明:以二叉链表作为存储结构,定义二叉树类型 bitree ; 实现二叉树的以下运算: 建立 create( ) 输入二叉树的结点元素,建立二叉链表。 选择一种遍历方式(先序、中序、后序、层序)遍历这棵二叉树。 求二叉数的树深度。 -To list as a binary storage structure, the definition of binary tree type bitree realize the following binary tree comput<candy930> 在 2025-06-26 上传 | 大小:2kb | 下载:0
[数据结构常用算法] duiliewenti
说明:队列相关问题 (C++) 队列的算法 题目:假设以带头结点的循环链表表示队列,并且只设一个指针指向队尾(注意不设头指针),试编写相应的置空队、入队、出队的算法。设队列中存放着 n 个字符,试编写算法,判断该字符串是否有中心对称关系 -Queue-related issues (C++) Queue algorithm Title: assumptions in order to take the lead in the cycle of nodes express queue l<candy930> 在 2025-06-26 上传 | 大小:2kb | 下载:0
[matlab例程] azimuthTDOA.m
说明:A sound source can be localized in a two dimensional plane using the audio recorded at three known microphone locations. Much like a GPS system, Time Difference of Arrival algorithms can be used to determine the difference in time and distance of a s<Sam> 在 2025-06-26 上传 | 大小:2kb | 下载:0