Consider the following algorithm Algorithm Mystery(A[0..n-1, 0..n - 1]) //Input: A matrix A[0..n-1, 0..n - 1] of real numbers for i ← 0 to n - 2 do for ji+ 1 to n - 1 do if A[i, j] = A[j,i] return true return false a. What does this algorithm compute? b. What is its input size? c. What is its basic operation? d. How many times is the basic operation executed? e. What is the efficiency class of this algorithm? f. Suggest an improvement, or a better algorithm altogether, and indicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done.

Interpolation is the name given to the procedure that includes guessing the value of a function at a location that is beyond the range of the available data.

Provide the correct c++ code for below code /****************************************************************************** Welcome to GDB Online. GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl, C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog. Code, Compile, Run and Debug online from anywhere in world. *******************************************************************************/ #include using namespace std; #include int hextodec(char num[]) { int len = strlen(num); int base = 1; int temp = 0; for (int i=len-1; i>=0; i--) { if (num[i]>='0' && num[i]='A' && num[i]

Write a servlet to display a table that contains factorials for thenumbers from 0 to 10, as shown in Figure .