Answer the given question with a proper explanation and step-by-step solution. using while loop

please read the question carefully and answer the question carefully

- Question Completion Status: Quèstion 7 (Big-O Analysis) Total number of comparisons in algorithm A is 2n2 +n+1 and total number of comparisons in algorithm B is 2nlog(n) + 8n, where 'n' is input size. (The base of log is 2). Order of algorithm A is O( (a) ). Order of algorithm B is O( (b)). What is (a) and (b) ? O (a): n2, (b): n2 o (a): n2, (b): nlog(n) (a): n, (b): nlog(n) (a): n2 +n, (b): log(n) ows b A Moving to another question will save this response.

Use pseudocode to describe an algorithm that takes as input a list of n distinct integers and finds the location of the smallest odd integer in the list or returns 0 if there are no odd integers in the list. (Note: Use the operation "is odd" in your code, or similar; don't attempt to craft odd-ness checking logic.)

Example-The Factorial Function To illustrate the operation of a for loop, we will use a for loop to calculate the factorial function. The factorial function is defined as n = 0 – 1) ×ばつ (n – 2) ×ばつ ... X 2x1 n>0 n! = (5.3) The MATLAB code to calculate N factorial for positive value of N would be n_factorial = 1 for ii = 1:n n_factorial = n_factorial * ii; end Suppose that we wish to calculate the value of 5!. If n is 5, the for loop control expression would be the row vector [1 2 3 4 5]. This loop will be executed 5 times, with the variable ii taking on values of 1, 2, 3, 4, and 5 in the successive loops. The resulting value of n_factorial will be 1 X 2 x 3 x 4 x 5 = 120. MATLAB includes a standard function called zactoriai to calculate the factorial function. Use the MATLAB help system to look up this function. Calculate 71, 141, and 21! using the program ini this example 7! = 14! = 21! = Calculate 7!, 14!, and 21! using the factorial function. 7! = 14! = 21! = How do the results compare?

There are three subtleties in the design of enumeration-controlled loops that are presented.

define iteration.

- .is Complete history of everything that the agent has ever perceived. * Percept percept sequence Agent functions None

i = 1 while (i < n) do s = s + i i = i * 2 enddo Is the step count dependent on which term?

IN VISUAL BASIC, solve Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

solve code in matlab

Write a recursive algorithm with the following prototype: int add (int x, int y); that returns x if y is 0; and adds x to y otherwise. THE FUNCTION MUST BE RECURSIVE. (hint: the base case should involve a test for y being 0; recursive case should reduce y towards 0)