Tool/software: TI C/C++ Compiler
Hi,
my customer tested two methods
1.
memset(array, 0, sizeof(array[0][0]) * m * n)
2.
for(j = 0; j < n; j++)
{
for(i = 0; i < m; i++)
{
array[i][j] = 0;
}
}
The second code will occupy more space, but it can run faster than the first code, right? We measured that the second code runs faster, but we are not sure if it's true.