资源列表
[数学计算/工程计算] jiefangcheng
说明:采用Gauss列主元消去法解线性方程组,输入所有系数后即可解得所有未知数的值-with this programme,you dcan work out any functions quickly,all you need to do is type in the seriels numbers<刘进锋> 在 2025-06-21 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] LSapproximating
说明:给定一组数据 进行最小二乘拟合 包括使用以正交多项式为基底的拟合-Given a set of data, including the use of orthogonal least squares polynomial fitting for the basement<kevin stone> 在 2025-06-21 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] dd
说明:shell sort is a rather curious algorithm, quite different from other fast sorting algorithms. It s actually so different that it even isn t an O(nlogn) algorithm like the others, but instead it s something between O(nlog2n) and O(n1.5) depending on i<sereen> 在 2025-06-21 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] heap_sort
说明:heap sort is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure tha<sereen> 在 2025-06-21 上传 | 大小:2kb | 下载:0
[数学计算/工程计算] insertion
说明:is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure that the sort<sereen> 在 2025-06-21 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] quick
说明:quick sort is the most popular sorting algorithm. Its virtue is that it sorts in-place (even though it s a recursive algorithm) and that it usually is very fast. On reason for its speed is that its inner loop is very short and can be optimized very w<sereen> 在 2025-06-21 上传 | 大小:1kb | 下载:0