simp1.cpp

来自「单纯型法」· C++ 代码 · 共 23 行

#include "stdafx.h"
#include <math.h>

void simp1(double **a,int mm,int ll[],int nll,\
		   int iabf,int *kp,double *bmax)
{
	int k;
	double test;

	*kp=ll[1];
	*bmax=a[mm+1][*kp+1];
	for (k=2;k<=nll;k++) {
		if (iabf == 0)
			test=a[mm+1][ll[k]+1]-(*bmax);
		else
			test=fabs(a[mm+1][ll[k]+1])-fabs(*bmax);
		if (test > 0.0) {
			*bmax=a[mm+1][ll[k]+1];
			*kp=ll[k];
		}
	}
}