01-05-2007, 06:19 AM
Thanks for that info. Actually yes, f.Value=aa is very fast. That was a bad post by by me (had been away for a few days).
What I was really asking is if the array sorting functions you created shoud be expected to be slower than Excel. When I sort an array with columns of 50,000 values in Excel, it happens very quickly. But my QM macro doing the same thing takes a bit of time (but it is easier because some of the other operations happen automatically!).
I was curious to know if I should expect QM to be slower. If it should sort at the same speed as Excel then I will look at my code harder to see if something else is slowing it down.
My machine has 2GB of memory.
What I was really asking is if the array sorting functions you created shoud be expected to be slower than Excel. When I sort an array with columns of 50,000 values in Excel, it happens very quickly. But my QM macro doing the same thing takes a bit of time (but it is easier because some of the other operations happen automatically!).
I was curious to know if I should expect QM to be slower. If it should sort at the same speed as Excel then I will look at my code harder to see if something else is slowing it down.
My machine has 2GB of memory.