Suppose you are collecting performance data for the selection sort shown below, and you collect elapsed times as shown and graph those times. What trend would you expect the graph to show? void selection_sort(int a[], int size) { } int next; for (next = 0; next < size - 1; next++) { } int min_pos= min_position (a, next, size - 1); if (min_pos != next) { } int before = time(0); swap(a [min_pos], a[next]); int after cout << (after before) << endl; Constant time Linear Log Quadratic time(0);

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.