choose proper n's

Even sorting 2000 random numbers takes not enough time to be measurable accurately. And since merge sort's average case performance is logarithmic, I've chosen n accordingly. With that I can see if the duration of sorting increases in a linear manner.