The following function takes an array of n integers as its input and returns 1 if the array is sorted in non-decreasing order, 0
otherwise. Using big-oh notation, what is the worst-case runtime for this function? What is the best-care runtime for this function? Please explain. I am not sure how to calculate.
int is_sorted(int *array, int n) {
int i;
for (i = 0; i < n - 1; i++)
if (array[i] > array[i + 1])
return 0;
return 1;
}
int is_sorted(int *array, int n) {
int i;
for (i = 0; i < n - 1; i++)
if (array[i] > array[i + 1])
return 0;
return 1;
}
1 answer:
You might be interested in
Convert
0.625 to binary
Translate 0.625 into a fraction. We all know that 0.5 is ½. We know that the remainder, 0.125, is ⅛. Add them together, and you get ½ + ⅛ = ⅝.
Now, in binary, the positions to the right of the point are , which is ½, ¼, and ⅛ respectively.
⅝ is 5 × ⅛. 5 in binary is 101. So, ⅝ is
= 0.101