I have a DSA Lab where I'm comparing the run time between the most common sorts (merge, selection, insertion, heap, quick) and one alternative sort....

I have a DS&A Lab where I'm comparing the run time between the most common sorts (merge, selection, insertion, heap, quick) and one alternative sort. I chose to implement Radix Sort.

I'm randomizing an array[100] from 0-999. If I'm truly comparing runtime between sorts, is it important that each sort use the same "starting unsorted array" or can I generate randomized array for every sort?

How would I have them sort the same sample? I feel like I need to have a pointer to the starting array and store it on the heap, but I'm still a newb.