Precisely specify the conditions under which the following algorithm returns true, and then discuss, in detail, the running time of the algorithm. If you think it has different best- and worst-case running times then these should be considered separately, and you should explain the conditions under which best and worst-cases arise. You must fully explain your answer and use O, and 0 appropriately.

Based on the example given on the image below, give a big-O estimate for the number of operations, where an operation is a comparison or a multiplication, used in this segment of an algorithm.

The following is a Matlab code. I am getting too big of an error. The max error should be less than 1*10^-3. I think its because of the backslash operator I used here, X = A \ b. I can't do X = A * inv(b) because b is not a square matrix. How should I reduce the error? % Problem 1% Step 1: Compute the right-hand side vector bn = 20;Xo = ones(n, 1); % Column vector with ones in each componentA = zeros(n); % Initialize the matrix A for i = 1:n for j = 1:n A(i, j) = 1 / (i + j - 1); endend b = A * Xo; % Step 2: Solve the system AX = b numericallyX = A \ b; % Backslash operator for numerical solution % Step 3: Compute the error vector E and find the maximum componentE = X - Xo;E_inf = max(abs(E));

Precisely specify the conditions under which the following algorithm returns True, and then discuss, in detail, the running time of the algorithm. If you think it has different best- and worst-case running times then these should be considered separately, and you should explain the conditions under which best and worst-cases arise.

Consider the following functions as time complexities of some algorithms. (a) First write the worst-case runtime of each algorithm in Big-O notation. (b) Then arrange functions from low to high (Consider their Big-O notations as you arrange them; as n grows, the function that grows slower should come sooner than the one that grows faster). (c) Arbitrary, select TWO of arrangements in part (b) and for each one of them justify why you have chosen such an ordering for the corresponding function. Provide formal proof. For example if fl<=f2<= f3<= f4<=f5 you may choose to formally justify why (1) fl<=f2 and why (2) f4<=f5 . fI(n)=n2, f2(n)=210 nlogn, f3(n)=3", f4(n)=n, f5(n)=1, f6(n)=5*logn, f7(n)= n", f8(n)=4 n*n, f9(n)=2log(n3)

Some one please explain what is "where z′ is the value of z after the statement is executed" given in the question. CAN SOME ONE PLEASE SOLVE THIS QUESTION CORRECTLY WITH PROPER EXPLANATION OF WHICH CONDITION TO CONSIDER.

What is the best case scenario? What is the exact number of operations for the best case scenario in terms of n and m? What is the big-oh for the best case scenario? What is the worst case scenario? What is the exact number of operations for the worst case scenario in terms of n and m? What is the big-oh for the worst case scenario? Consider the following algorithm tha finds a row where every entry is x in a 2-D array. Assume that (a) the array has n rows and m columns, and that (b) the comparison on line 3 counts towards the running time.

please show answer how its inputed correctly