登录
首页 » Fortran » sort

sort

于 2020-06-29 发布 文件大小:1KB
0 148
下载积分: 1 下载次数: 3

代码说明:

  快速排序法和堆排序法Fortran90程序,其中快速排序法使用到了递归过程,因此对于堆栈要求较高(both Quicksort and Heapsort program are used for sort array. Note that a recursion process is used in Quicksort program, Thus it need require a relative high stack size.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • KMEANS
    This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )
    2013-01-05 23:11:23下载
    积分:1
  • MatrixCalculator
    实现线性代数的矩阵运算的C++程序,矩阵计算器。(Linear algebra matrix operations C++ procedures matrix calculator.)
    2013-01-26 15:33:54下载
    积分:1
  • water-drop-vof
    用Fluent VOF模型模拟单个小水滴落入盛水的水杯之中(Fluent VOF model simulations using a single drop falling into a water glass)
    2021-04-01 22:19:07下载
    积分:1
  • 0123
    对数据进行统计分析,并打开图形数据统计分析对话框,该对话框可以获得数据的最小值、最大值、平均值、中值以及均方差等。 (Statistical analysis of data and graphical data statistical analysis of open dialog, the dialog box can be data minimum, maximum, average, median and standard deviation and so on.)
    2008-04-30 02:32:50下载
    积分:1
  • repeated-measures-ANOVA
    用MATLAB实现单因素/两因素重复测量方差分析,自带工具包中只有非重复测量的方差分析函数ANOVA。anova_rm实现单因素;rm_anova2实现两因素( function stats = rm_anova2(Y,S,F1,F2,FACTNAMES) Two-factor, within-subject repeated measures ANOVA.For designs with two within-subject factors. function [p, table] = anova_rm(X, displayopt)Single factor, repeated measures ANOVA.)
    2021-01-26 17:58:37下载
    积分:1
  • Fluent_tutorial
    Fluent 学习文件 全方位的指导手册 (Building geometry Setting boundary condition types)
    2014-01-14 10:26:21下载
    积分:1
  • Desktop
    说明:  在进行激光熔覆或者焊接时可用到的移动热源命令流(Command flow of moving heat source available during laser cladding or welding)
    2020-07-01 22:55:37下载
    积分:1
  • 逆broyden迭代法
    逆BROYDEN迭代法求解非线性方程组:是一种相对比较新的一种方法,克服了牛顿迭代法需要求导数和求逆的缺点。本程序提供解法和画图流程,注意多迭代几步(Inverse BROYDEN iteration method is a relatively new method for solving nonlinear equations, which overcomes the shortcomings of Newton iteration method in derivative and inversion. This program provides solution and drawing process. Remember more several steps of iteration.)
    2019-02-10 15:37:57下载
    积分:1
  • 单纯形法Matlab程序-2016-11-17
    一般线性规划问题具有线性方程组的变量数大于方程个数,这时会有不定的解。当决策变量个数n和约束条件个数m较大时,单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形,每一个单纯形可以求得一组解,然后再判断该解使目标函数值是增大还是变小了,决定下一步选择的单纯形。通过优化迭代,直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
    2018-03-27 17:22:03下载
    积分:1
  • Dijkstra
    求数组最长递增子序列算法。输入一个数组,输出其最大递增子序列(Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence)
    2007-08-07 16:14:13下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载