我從文本文件中獲得了2d數組,併成功打印出來。不過,我不能將這些元素用於函數參數。如何從2d數組中獲取元素並將它們用於c中的函數參數?
這裏是代碼打印二維數組:
fscanf(fp, "%d", &row);
//printf("%d\n", row);
array = (int**)malloc(sizeof(int*)*row);
for (u = 0; u < row; u++) {
array[u] = (int*)malloc(sizeof(int)*col);
for (v = 0; v < col; v++) {
fscanf(fp, "%d", &array[u][v]);
printf(" %d ", array[u][v]);
}
printf("\n");
}
free(*array);
free(array);
和功能
for (i = 0; i < row; i++) {
printf("Iteration GCD = %d \n", iteration(u,v));
printf("Recursive GCD = %d \n", recursive(u,v));
}
的代碼,我得到了相同的價值......儘管每個列的值是不同的。 我應該更改我的代碼源?
[全部代碼]
int iteration(int x, int y);
int recursive(int x, int y);
int main(void)
{
/*Define Variables*/
LARGE_INTEGER timefeq, start, end;
int i, u, v, row;
int col = 2;
double result;
int **array;
FILE *fp = fopen("data1.txt", "r");
if (fp == NULL) {
printf("READ ERROR!!\n");
return 1;
}
else {
fscanf(fp, "%d", &row);
//printf("%d\n", row);
array = (int**)malloc(sizeof(int*)*row);
for (u = 0; u < row; u++) {
array[u] = (int*)malloc(sizeof(int)*col);
for (v = 0; v < col; v++) {
fscanf(fp, "%d", &array[u][v]);
printf(" %d ", array[u][v]);
}
printf("\n");
}
free(*array);
free(array);
}
QueryPerformanceFrequency(&timefeq);
result = pow(2,63);
if ((u > result - 1) || (v > result - 1)) {
printf("Wrong input value!\n");
return 0;
}
/* Compute */
//array[u][0] = abs(u);
//array[0][v] = abs(v);
for (i = 0; i < row; i++) {
QueryPerformanceCounter(&start);
iteration(u, v);
printf("Iteration GCD = %d \n", iteration(u, v));
QueryPerformanceCounter(&end);
printf("Operation time: %.4f μsec\n", 1000 * (double)(end.QuadPart - start.QuadPart)/(double)timefeq.QuadPart);
QueryPerformanceCounter(&start);
recursive(u, v);
printf("Recursive GCD = %d \n", recursive(u,v));
QueryPerformanceCounter(&end);
printf("Operation time: %.4f μsec\n", 1000 * (double)(end.QuadPart - start.QuadPart)/(double)timefeq.QuadPart);
printf("\n------------------------------------------------------------\n");
}
/*End Program*/
fclose(fp);
return 0;
}
/*-----------------------------------------------------------*/
int iteration(int a, int b) {
int tmp;
while (b) {
tmp = a;
a = b;
b = tmp%b;
}
return a;
}
/*----------------------------------------------------------*/
int recursive(int a, int b) {
if (a%b == 0)
return b;
else return recursive(b, a%b);
}
/*--------------------------------------------------------*/
你能發表整個代碼嗎?具體來說,在哪裏調用函數。如果它在循環之後,u和v將不會改變。 –
不相關的,你的讀者代碼用於動態創建你的指針數組和每一行內的數據都在泄漏內存。計算'malloc's。有'行+ 1'的總分配,並且只有*兩個*'免費'。 – WhozCraig
@AjayBrahmakshatriya我添加了整個源代碼 – Lumby