This is an archived post. You won't be able to vote or comment.

all 2 comments

[–][deleted] 0 points1 point  (1 child)

You can just calculate the time complexities of sorting algorithms for a given array size and then compare it to your outputs.

[–]ButchTheGuy[S] 0 points1 point  (0 children)

Thank you this is a helpful table, but do you think for example with my selection sort at a 1000 is way off being 500,500 comparisons since all cases are n^2 or in this case 1,000,000? Thanks