Re: Filling 2d array in less than O(n^2)?



On 18 Nov 2005 13:22:56 -0800, pjhyett@xxxxxxxxx wrote:

>standard 2d array filling with increasing numbers for rows and columns:
>
>for(int i=0;i<n;i++)
> for(int j=0;j<n;j++)
> a[i][j] = i + j;
>
>problem is it's O(n^2)

With respect to what operation?...

A.L.
.