Search - n2-1 - CodeBus

Search - n2-1 - List

[Mathimatics-Numerical algorithms] Interpolation-algorithm DL : 0: 7种插值算法的c++代码实现，1 拉格朗日插值(POLINT) 2 有理函数插值(RATINT) 3 三次样条插值(SPLINE(二阶导数值)->SPLINT(函数值)) 4 有序表的检索法(LOCATE(二分法), HUNT(关联法)) 5 插值多项式(POLCOE(n2), POLCOF(n3)) 6 二元拉格朗日插值(POLIN2) 7 双三次样条插值(SPLIE2)-seven interpolation algorithm to achieve the c code, a Lagrangian interpolation (POLINT) 2 rational function interpolation (RATINT) 3 cubic spline interpolation (SPLINE (second derivative numerical) -
Date : 2008-10-13 Size : 4.93kb User : ldg
[Mathimatics-Numerical algorithms] qipan DL : 0: 棋盘填数问题在N*N的棋盘上（1<=N<=10）请填入1，2，...N2共N2个数，使得任意两个相邻的数之和为素数。填写的方案如：在这里我们约定：左上角的格子里必须放数字1。输出：如有多种解，则输出第一行，第一列之和为最小的排列方案；若无解，则输出“NO Answer”-chessboard fill in N * N on the chessboard (1LT; = Nlt; = 10) Please insert 1,2, ... N2 N2 total number, making any two adjacent few and as a prime number. Fill in the program, such as : Here, we agreed : the upper left corner of the grid must be put in the yard a figure. Output : For a variety of solutions, the first line of output, the first out and as a program with the smallest; If not solved, then the output "NO Answer"
Date : 2008-10-13 Size : 880byte User : 信仰
[Mathimatics-Numerical algorithms] 一个局部搜索NQueen的O(n2)算法 DL : 0: 求N皇后问题的一个解：算法：QS1
Date : 2009-11-20 Size : 1.21kb User : abraham
[Mathimatics-Numerical algorithms] qipan DL : 0: 棋盘填数问题在N*N的棋盘上（1<=N<=10）请填入1，2，...N2共N2个数，使得任意两个相邻的数之和为素数。填写的方案如：在这里我们约定：左上角的格子里必须放数字1。输出：如有多种解，则输出第一行，第一列之和为最小的排列方案；若无解，则输出“NO Answer”-chessboard fill in N* N on the chessboard (1LT; = Nlt; = 10) Please insert 1,2, ... N2 N2 total number, making any two adjacent few and as a prime number. Fill in the program, such as : Here, we agreed : the upper left corner of the grid must be put in the yard a figure. Output : For a variety of solutions, the first line of output, the first out and as a program with the smallest; If not solved, then the output "NO Answer"
Date : 2026-01-08 Size : 1kb User : 信仰
[Mathimatics-Numerical algorithms] Interpolation-algorithm DL : 0: 7种插值算法的c++代码实现，1 拉格朗日插值(POLINT) 2 有理函数插值(RATINT) 3 三次样条插值(SPLINE(二阶导数值)->SPLINT(函数值)) 4 有序表的检索法(LOCATE(二分法), HUNT(关联法)) 5 插值多项式(POLCOE(n2), POLCOF(n3)) 6 二元拉格朗日插值(POLIN2) 7 双三次样条插值(SPLIE2)-seven interpolation algorithm to achieve the c code, a Lagrangian interpolation (POLINT) 2 rational function interpolation (RATINT) 3 cubic spline interpolation (SPLINE (second derivative numerical)-
Date : 2026-01-08 Size : 5kb User : ldg
[Mathimatics-Numerical algorithms] fft DL : 0: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一，1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn)，推进了FFT更深层、更广法的研究与应用。这是一个傅氏变换的MPI程序，用C语言实现。-Discrete Fourier Transform of the 20th century 60 s computational complexity is a major milestone in one study, in 1965 Cooley and Tukey studied the calculation of discrete Fourier transform (Discrete Fourier Test) fast Fourier transform (FFT) calculation increased from О (n2) dropped to О (nlogn), the FFT to promote deeper, broader research and application of law. This is a Fourier transform of the MPI process, with C language.
Date : 2026-01-08 Size : 4kb User : chj
[Mathimatics-Numerical algorithms] 1 DL : 0: 设计一个O(n*n)时间的算法，找出由n个数组成的序列的最长单调递增子序列--design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.
Date : 2026-01-08 Size : 1kb User : heqin
[Mathimatics-Numerical algorithms] n2 DL : 0: 从论坛转载的源码，自己修改了一下，希望大家喜欢！-Reproduced from the Forum, the source code for their own change a bit I hope everyone likes!
Date : 2026-01-08 Size : 1kb User : jacky Zhang
[Mathimatics-Numerical algorithms] bubble DL : 0: Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations
Date : 2026-01-08 Size : 1kb User : irisrd