Question 1: Order the following functions by their asymptotic growth rates, from slowest to the fastest:...

 

Transcribed Image Text:

Question 1: Order the following functions by their asymptotic growth rates, from slowest to the fastest: points] N, No.5, NNº.5, NN, NlogN, Nlog(logN) Answer: Question 2: What is the running time (time complexity) in terms of big-O for each of the following pseudo code fragments? A) i - 1 while i <= N do i - i*2 Answer: B) for i- 1 to N do for j - 1 to N*N do sum → sum + a[i] + j Answer: [10 points] [10 Question 3: An algorithm running time is O(N²). The algorithm takes 0.5 millisecond for input size 100. How long will it take for input size 500? [10 points] Answer: Answer: Question 4: Write a C++ template function that returns the minimum element in an array of n values. [10 points] Question 1: Order the following functions by their asymptotic growth rates, from slowest to the fastest: points] N, No.5, NNº.5, NN, NlogN, Nlog(logN) Answer: Question 2: What is the running time (time complexity) in terms of big-O for each of the following pseudo code fragments? A) i - 1 while i <= N do i - i*2 Answer: B) for i- 1 to N do for j - 1 to N*N do sum → sum + a[i] + j Answer: [10 points] [10 Question 3: An algorithm running time is O(N²). The algorithm takes 0.5 millisecond for input size 100. How long will it take for input size 500? [10 points] Answer: Answer: Question 4: Write a C++ template function that returns the minimum element in an array of n values. [10 points]

Answer rating: 100% (QA)

Answer1From slowest to fastest order iNN iiNN05 iiiNlogN ivNloglog... View the full answer