資源簡介
c++寫的全主元高斯消元法,代碼清晰易懂,帶有詳細注釋。
代碼片段和文件信息
#include?
#include?
#define?M?1000
void?swap(double?&adouble?&b)?????????///行列交換
{
????double?c;
????c=a;
????a=b;
????b=c;
}
int?main()
{
????int?n;
????printf(“請輸入維數n:“);
????scanf(“%d“&n);
????for(;;)
????{
????????if(n>=2&&n<=1000)
????????{
????????????break;
????????}
????????printf(“維數有誤,請重新輸入:“);
????????scanf(“%d“&n);
????}
????static?double?a[M][M]b[M];
????int?ij;
????printf(“請輸入各個參數:\n“);
????for(i=0;i ????{
????????for(j=0;j ????????{
????????????printf(“a[%d][%d]=“ij);
????????????scanf(“%lf“&a[i][j]);
????????}
????????printf(“b[%d]=“i);
????????scanf(“%lf“&b[i]);
????}
????printf(“增廣矩陣為\n“);
????for(i=0;i ????{
????????for(j=0;j ????????{
????????????printf(“%5.2f\t“a[i][j]);
評論
共有 條評論