|
Given
the following code:
void mysterySort ( double [] v )
{
int n = v.length;
for (int
i = 1; i < n; i++) {
// move element v[i] into
place
double element = v[i];
int j = i - 1;
while (j >= 0 && element < v[j])
{
v[j + 1] = v[j]; // slide old value
over
j = j - 1;
}
// place element into
position
v[j + 1] = element;
}
}
What is the Big O runtime behavior? a. | n | c. | n log
n | b. | n | d. | log
n | | | | |
|