| 首页 > IT文章 > 程序设计 > |
| |
| 用C语言编程递归求行列式的值 |
|
[科技论文网]
http://www.scipapers.com 2007-12-02
|
|
|
printf("]\n************\n"); WriteMatrix(ipNewMatrix, iColComput - 1); #endif
iResult += *(ipMatrixComput + CurrentRow * iColComput) * ComputMatrix(ipNewMatrix, iColComput - 1) * ((CurrentRow + 1) % 2 ? 1 : -1);
#if IsDebug == 1 printf("result=%d\n", iResult); getch(); #endif
free(ipNewMatrix); } } } } return (iResult); }
void main(void) { int *ipMatrix, iRowOrCol; char chSure; while (1) { printf("\n\nEnter the row or col of matrix:"); scanf("%d", &iRowOrCol); if (iRowOrCol > 0) { if (ipMatrix = (int *)malloc(iRowOrCol * iRowOrCol * sizeof(int))) { while (1) { ReadMatrix(ipMatrix, iRowOrCol); WriteMatrix(ipMatrix, iRowOrCol); printf("Are you sure(Y/N)?"); chSure = getche();
if (toupper(chSure) == 'Y') { break; } else { printf("\n\n"); } } printf("\n\n= %d\n", ComputMatrix(ipMatrix, iRowOrCol)); free(ipMatrix); } else { printf("Error:No enough memory!\n"); break; } } else { printf("Invalid col value!\n\n"); } printf("\nCompute another Matrix(Y/N)?"); chSure = getche(); if (toupper(chSure) != 'Y') { break; } } }
来源:
|
|
声明:本文由网友推荐或作者提交,版权归原作者所有,刊登此文仅为传播知识,展示研究成果,提高文章引用率。未经原作者授权,禁止用于任何形式的商业行为。科技论文网倡导尊重知识、尊重劳动、保护原创、知识共享。由于部分论文文章来于网络,文章作者不祥,请相关的原创作者与我们联系,以便加上您的署名。
|
| |
|
|
|
|
 |
论文分类 |
|
| |
|
|
|