Some very basic problems about sorting algorithms

[yanhe0116]

Hi, guys,

I have several question about the sorting algorithms. Hopefully u give me the explanation. Thanks.
1. Can you use the times for smaller arrays to predict the time needed to sort larger arrays? How closely do your actual running times for large arrays match your predictions based on the running time of smaller arrays?

2. Did the times for Selection Sort increase at the rate you expected given that the algorithm is O(n2) ?

Thanks again.