Jason's assignment is to write either a SelectionSort or a Quicksort. She elects one of the two sorts and implements it correctly. When she runs the sort on a list of length $n=5,000,$ the sort takes $20$ time units. When she runs the sort on a list of $n=100,000,$ the sort takes $525$ time units. SelectionSort is $O(n^2)$ and Quicksort is $O(nlogn).$ Which sort do you think she implemented? Why?

Type out the math you used to come to your decision.