I try to operate on aligned-size array and non-aligned-size array, but the result is a puzzle me, the non-aligned-size array is faster than aligned-size array, This is my code:

```
TimeMeter timeMeter;

const int N = 100000;

_Tp A[64];
_Tp B[65];

int szA = sizeof(A);
int szB = sizeof(B);

//  Method 1
timeMeter.start();
for ( int n = 0; n < N; n++ )
{
    memset(A, 0, szA);
}
timeMeter.stop();
printf("Method 1 Time usage = %f ms\n", timeMeter.span());

//  Method 2
timeMeter.start();
for ( int n = 0; n < N; n++ )
{
    memset(B, 0, szB);
}
timeMeter.stop();
printf("Method 2 Time usage = %f ms\n", timeMeter.span());

```

* When `_Tp` is `char` (8): Method 1 cost 2.195ms and Method 2 cost 2.175ms
* When `_Tp` is `int` (32): Method 1 cost 13.313ms and Method 2 cost 5.987ms
* When `_Tp` is `double` (64): Method 1 cost 14.266ms and Method 2 cost 11.304ms