Answered: For each of the following program… | bartleby

Related questions

Question

100%

For each of the following program fragments:
Give an analysis of the running time (Big-Oh). Justify your answer?
A.
public class GFG {
// Linearly search x in att[]. if x is present then
//return the index, otherwise return -1
static int search (int arr[], int n, intx)
{
int i;
for (i = 0; i<n;i++){
if (arr[i] ==x){
return i;
}
}
return -1;
}
[Marking criteria: 1 mark for answer, 1 mark for the Justify]

B.
sum=0;
for(i=0; i<n; i++)
for(j = 0; j <i* i; j++ )
for(k = 0; k<j; k++)
sum++;
[Marking criteria: 1 mark for answer, 1 mark for the Justify]

Expert Solution

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

3. Implement in python. Consider the sample size of N=25 drawn from a normal distribution with mean 50, and standard deviation of 2. Repeat the process 200 tines. Draw the sampling distribution of sample mean. what is the mean of the sampling distribution of the sample mean and standard distribution of the sample mean? How do that compare with population mean and standard deviation.
Can the above algorithm be ran through a test example?
Implement the problem below in Python using mpi4py. Submit the code of your program and a brief report. The report should describe the design of your program, and demonstrate the results of running your program. n-body solver. Implement a parallel n-body solver with n = 10 particles. You may randomly generate the masses, initial velocities, and initial positions of all particles at the beginning. Compute the positions of all particles after 1 second. Compare the results by using 0.1s, 0.01s, and 0.001s as the time in each timestep, respectively.
Imagine you have 331 sheep, and you are going to use primitive counting to write a tally stick for the King. Suppose you carry out the procedure as usual, filling the pens with sheep, and liberating the sheep from pen 2 (and any extra sheep); then doing it again, doing it again, etc., until you get down to one sheep.How many sheep will you have in the first pen After one round? After two rounds? After three rounds?
2. R(N) is the running time of strange_sum when called on a List of length N. Since this is recursive code, your answer to iii should include a diagram of the recursion tree. a. Answer for li being an ArrayList b. Answer for li being a LinkedList static int strange_sum(List li) { return strange_sum_helper(li, 0, li.size() - 1); static int strange_sum_helper (List arr, int left, int right) { if (right - left < 0) return 0; else if (right else { int mid = (left + right) / 2; return strange_sum_helper(arr, left, mid) left 0) return arr.get(left); == + strange_sum_helper(arr, mid + 1, right); } }