What are the Big-Oh and Omega orders of the following code fragment? What is Tilde approximation?...

Question

Question

What are the Big-Oh and Omega orders of the following code fragment? What is Tilde approximation?

The fragment is prameterized on the variable n. Assume that you are measuring the number of swap calls.

for(int j=0;j<n-1;j++){

int z = j;

for (int i=j+1; i<n; i++){

if(a[i] < a[z]){

z=i;}

}

if(z!= j){

swap(a[j], a[z]); //count these

}

Answer 1

Answer #1

Answer:

outer loop iterates n times.
inner loop iterates O(n) times.
so, time complexity is O(n^2)

Big-Oh: O(n^2)
Big-Omega: Ω(n^2)

Answer 2

Similar Homework Help Questions

What is the Big-Oh order of the following code fragment? The fragment is parametrized on the...

What is the Big-Oh order of the following code fragment? The fragment is parametrized on the variable N. Assume that you are measuring the number of times j is decremented. public static void sort(Comparable[] a) { int N-a.length; for (int i = 1; i < N;i++) { for (int j = i; j > && less(a[5], a[j-1]); j--) //measure j -- exch(a, j, j-1); O(nlogn) O O(n^2) Q(n) Does not exist.
Q-1: Given the following code fragment, what is its Big-O running time? test = 0 for...

Q-1: Given the following code fragment, what is its Big-O running time? test = 0 for i in range(n): for j in range(n): test= test + i *j Q-2: Given3 the following code fragment what is its Big-O running time? for i in range(n): test=test+1 for j in range(n): test= test - 2 Q-3: Given the following code fragment what is its Big-O running time? i = n while i > 0: k=2+2 i...
1. Determine the appropriate big-o expression for each of the following functions, and put your answer...

1. Determine the appropriate big-o expression for each of the following functions, and put your answer in the table we have provided in section 2-1 of ps5_parti. We've included the answer for the first function. (Note: We're using the “ symbol to represent exponentiation.) a (n) = 5n + 1 b. b(n) = 5 - 10n - n^2 o c(n) = 4n + 2log (n) d. e. d(n) = 6nlog (n) + n^2 e(n) = 2n^2 + 3n^3 - 7n...

Show how to get the big-Oh for the following code: void CountSort (int A[N], int range)...

Show how to get the big-Oh for the following code: void CountSort (int A[N], int range) { // assume 0 <= A[i] < range for any element A[i] int *pi = new int[range]; for ( int i = 0; i < N; i++ ) pi[A[i]]++; for ( int j = 0; j < range; j++ ) for ( int k = 1; k <= pi[j]; k++ ) cout << j << endl; }
8. R-4.8 Order the following functions by asymptotic growth rate. 4nlogn + 2n 2^10 2^logn 3n...

8. R-4.8 Order the following functions by asymptotic growth rate. 4nlogn + 2n 2^10 2^logn 3n + 100logn 4n 2^n n^2 + 10n n^3 nlogn 9. R-4.9 Give a big-Oh characterization, in terms of n, of the running time of the example 1 method shown in Code Fragment 4.12. 10. R-4.10 Give a big-Oh characterization, in terms of n, of the running time of the example 2 method shown in Code Fragment 4.12. 11. R-4.11 Give a big-Oh characterization, in...
find complexity Problem 1 Find out the computational complexity (Big-Oh notation) of the code snippet: Code...

find complexity Problem 1 Find out the computational complexity (Big-Oh notation) of the code snippet: Code 1: for (int i = n; i > 0; i /= 2) { for (int j = 1; j < n; j *= 2) { for (int k = 0; k < n; k += 2) { // constant number of operations here } } } Code 2: Hint: Lecture Note 5, Page 7-8 void f(int n) { if (n...

Using C++ please explain What is the Big-O time complexity of the following code: for (int...

Using C++ please explain What is the Big-O time complexity of the following code: for (int i=0; i<N; i+=2) { ... constant time operations... Select one: o a. O(n^2) O b. O(log n) c. O(n) O d. 0(1) What is the Big-O time complexity of the following code: for(int i=1; i<N; i*=2) { ... constant time operations... Select one: O O a. O(n^2) b. 0(1) c. O(n) d. O(log n) O What is the Big-O time complexity of the following...
Which big-O expression best characterizes the worst case time complexity of the following code? public static...

Which big-O expression best characterizes the worst case time complexity of the following code? public static int foo(int N) ( int count = 0; int i1; while (i <N) C for (int j = 1; j < N; j=j+2) { count++ i=i+2; return count; A. O(log log N) B. O(log N2) C. O(N log N) D. O(N2)
JAVA: What is the Big-O cost of the following code (n is a large positive integer)?...

JAVA: What is the Big-O cost of the following code (n is a large positive integer)? int count = 0; for (int i = 1; i < n; i *= 2) { for (int k = i; k <= i + 8; k ++ ) { count ++; } }

(10') 6. For each of the following code blocks, write the best (tightest) big-o time complexity...

(10') 6. For each of the following code blocks, write the best (tightest) big-o time complexity i) for (int i = 0; ǐ < n/2; i++) for (int j -0: ni j++) count++ i) for (int í = 0; i < n; i++) for (int ni j0 - for (int k j k ni kt+) count++ İİİ) for (int í ー 0; i < n; i++) for(int j = n; j > 0; j--) for (int k = 0; k...