Answered: calculate number of operations in this…

calculate number of operations in this algorithm for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { y[i] += A[i * n + j] * x[j]; } }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Related questions

Q: Modify the following operations into a recursive procedure. void ditui(int n){ int i; i=n; }…

A: 1) Below is C program that defines another function which does operation using recursive procedureIt…

Q: sum = 0; for (int i = 1; i<n; i = sum++ 2*i)

A: Algorithm for the given code Declare a variable n and take the input for the value n. Declare sum…

Q: void test() { int i; int a[5]; void f(int x) { a[i] = 4 i = i + 1; i = 2 * x;

A: Call by copy-in-copy-out : As we know call by Copy-in-Copy-Out is also called a Call by…

Q: iii. 111. int sum = 0; for ( int i = 0; i<n; ++i ) { for ( int j= 0; j<n; ++j) { sum += f( j, 10 );…

A: Time complexity of whole code will be given by multiplying complexities of for loops and function…

Q: sum = 0; for (k=1; k<=n; k*=2) for (j=1; j<k; j++) sun++ What is the time complexity of…

A: The Time Complexity of the following code will be O(nlogn).

Q: What would be the missing part of the following C program to make following calculation? y[n] = );…

A: Here in the given question, we need to complete the function foo(), such that each index holds the…

Q: for (int i = 0;i>m2[i][j]; This C++ :code used to Count from 0 to 2 O Print the array m2 O Read the…

A: The given C++ code is for (int i = 0; i<2; i++){ for (int j = 0; j<3; j++) {…

Q: int n = 1; int k - 2; int r = n; if (k < n) { r -

A: The value of each variable after if is

Q: Complete the following sorting program with bubble sort algorithm. #include using namespace std;…

A: Here is the c++ Code: See below steps:

Q: (a) sum= 0; for (int i = 0; i 1) { sum++; i= 1/2; } = 2*log2 (n) We denote by Ta(n), Tb (n), Te(n)…

A: Fragment: A fragment is a portion of code that is incomplete or lacks the necessary syntax to be…

Q: function recursion(B[0..n − 1], i) if n == 0 then return False if n == 1…

A: Write the recursive formula for above algorithm as of worst case inputs

Q: Instruction: Explain the function of the program line by line thoroughly. Program: #include using…

A: Dear Student, The complete program with required inline comments is given below -

Q: int BinDig (int n) { if (n == 1) return 1; else return (1 + BinDig(n/2)); } Find T(n) = number of…

A: Answer is

Q: nction isPrime(n) { if (n < 2 || n % 1 ! return false; } for (let i = 2; i < %3D

A: Ans. ) YES, it's program to find prime number. Explanation:- Following program to find prime number…

Q: to convert this code to Ocaml programming language? void flip_matrix(bool arr[n][m],int x,int y) {…

A: It is defined as a general purpose programming language with an emphasis on expressiveness and…

Q: write a java code that can perform SQUARE-MATRIX-MULTIPLY-RECURSIVE. A; B(Strassen's Algorithms)/…

A: Matrix C = Matrix A * Matrix B Consider for now the mathematical computation of matrices is that it…

Q: int functionC (int n) { int i, j, sumC = 0; for (i=n; i > 0; i=i-5) for (j=1; j 0) { if (functionC…

A: The solution of the above question is:

Q: 1. a) Given a recursive algorithm as below: int F(int n) { if (n <= 1) return 1; else if (n % 2 ==…

A: To find F(10) 10%2==0, so it is F(9)+10 This will be F(4)-1+10 This will be F(3)+4-1+10 This will be…

Q: #include int main() { int a[5]; for (int i = 0; i = a) { a[i]+= a[j]; 0; j = 1) { n = n / 2;…

A: Code :

Q: I Evaluate the time complexity of following code: int a-0; for (i-0; i< N; i++){ aati;) for (i- 0;…

A: COMPLEXITY OF GIVEN CODE - int a = 0 ; for ( i = 0 ; i < N ; i ++ ) { a = a + i ; } for ( i = 0…

Q: For function sumtok, write the missing recursive call. This function returns the sum of the values…

A: Correct Code:- public int sumtok(int k) { if (k<= 0){ return 0; }else{ return k +…

Q: The following function f uses recursion: def f(n): if n 0 a <- a + i + (i-1) return a c) def f(n):…

A: The given recursive function calculates nth fibonacci number. Option a would have been correct if…

Q: 8. A() { Int I, j, k, n; For (I = 1; 1<= n; I++) { For (j = 1; jsi²;j++) { For (k =1, k< =, k+) {…

A: Given : In questions 4-10 estimate the Big 0 value by analyzing the code. Note the algorithms are…

Q: 2. About Numbers You need to make a program that: • asks a user to type in a positive number greater…

A: Program to check if a number is even or odd, is a multiple of 3 or not, is prime or not.

Q: using namespace std; int main() int i, m=0,n=4; float arr[100] (55,66,88,1); for(i=0; i<n; ++i) {…

A: The above is a cpp program. This program is finding the smallest element in array by continuously…

Q: sum 0; for (int i = 1; i<n; i = 2+i) Sum++

A: Answers:- n= value are not provide

Q: int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; imx) mx=arr[i]; returnmx; } Can u give…

A: Thе algorithm for the gеtMax() function is as follows:Initializе thе maximum valuе to thе first…

Q: int sum, k, i, j; int x[4][4]={1,2,3,4},{5,6,7,8},{9,8,7,3},{2,1,7,1}; sum=x[0][0]; for (k=1;…

A: Objective: A code segment is provided containing a matrix and a loop accessing some elements of the…

Q: For each of the following program fragments: Give an analysis of the running time (Big-Oh). Justify…

A: Let's consider the program A given above . As mentioned in the comments we can see that the program…

Concept explainers

Counting sort

The counting sort algorithm sorts an array’s contents by counting the repetition of each element that occurs in the array. A counting sort algorithm is a stable algorithm that works the best when the range of elements in the array is small, say for example from 0 to 9. The count which is the number of repetitions of an element in the array is mapped to an index of an auxiliary array, which is then saved in an auxiliary array. The counting sort algorithm has a stable time complexity of the order of O(size of array + size of auxiliary array). Let’s discuss the algorithm in detail as follows.

Question

calculate number of operations in this algorithm

for(int i = 0; i < n; i++) {

for(int j = 0; j < n; j++) {

y[i] += A[i * n + j] * x[j];

}

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

int functionC (int n) { int i, j, sumC = 0; for (i=n; i > 0; i=i-5) for (j=1; j 0) { if (functionC(n) % 2 == 0) { for (i=m; i > 0; i=i/3) sumE++; } else (10) Asymptotic runtime of functionE { for (i=m; i > 0; i=i-3) sumE--; } n--; } return sumE;
sum = 0; for (int i = 1; i< n; i = sum++ || 2*i)
// 9. Is It Prime? function isPrime(n) { if (n < 2 || n % 1 != 0) { return false; } for (let i if (n % i } return true; 2; i < n; ++i) { 0) return false; == }
In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.
What does the following code? void xxxx(int arr[], int index[], int n){int temp[n]; for (int i=0; i<n; i++)temp[index[i]] = arr[i]; for (int i=0; i<n; i++){arr[i] = temp[i];index[i] = i;}}
Figure 2 void sort_Algo (int anArray[], int n) { int i, j, idx; for (i = 0; i anArray[ idx ]) idx = j; Swap (anArray[ idx ], anArray[ i ]); } } int main() { const int n = 8; int anArray[n] { -9, 14, 52, 106, 22, -1, 99}; sort_Algo(anArray, n); } Name the sorting algorithm exercised by the sort_Algo() function. * Your answer Determine if anArray[] is to be sorted into ascending, or descending order. Your answer Trace the sorting algorithm in Figure 2 as it sorts anArray[]. (Answer the question according to the format, eg. Pass 0:3, 3, 3; Pass 1: 3, 3, 3; Pass2: 3, 3, 3;) * Your answer
Following C code computes the approximate roots and the absolute approximate error of f(x)=x³ -(1/sin(x)) function with both Regula-Falsi and Bisection methods for ten iterations. If the user enters key "1" Regula-Falsi method, if the user enters key "2" Bisection method, will run in the program. In this context, fill in the blanks of the given C code. double function(double x) { return int main(int argc, char *argv[]) { double a,b,x[10],error,FA,FB,FX; int option,i; printf(" ENTER 1 FOR Regula Falsi, ITER Bisection \n"); scanf("%d",&option); printf("Enter base of definition invterval\n"); scanf("%lf",&a); printf("Enter top of definition interval\n"); scanf("%lf",&b); FA= function (a); FB= function (b); if(FA*FB<0){ for(i=0;i< ;i++){ switch(option){ case 1: break;
How to convert this code to Ocaml programming language? void flip_matrix(bool arr[n][m],int x,int y){ for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(i==x && j==y) { arr[i][j]=!arr[i][j]; if(i+1<n ) // down element { arr[i+1][j]=!arr[i+1][j]; } if(j+1<m) // right element { arr[i][j+1]=!arr[i][j+1]; } if(j-1>=0) //// left element { arr[i][j-1]=!arr[i][j-1]; } if(i-1>=0) // up element { arr[i-1][j]=!arr[i-1][j]; } } } }} 2) void print_matrix(bool arr[n][m]){ for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(arr[i][j]==true) { cout<<"T"<<" ";…
int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; i<n; i++) if (arr[i] >mx) mx=arr[i]; returnmx; } Can u give me the code for this one as well....this is the first function and countsort is the second
#include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } int binarySearch(int arr[], int l, int r, int x, int& comp) { comp++; if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) { return mid; } if (arr[mid] > x) { return binarySearch(arr, l, mid - 1, x, comp); } return binarySearch(arr, mid + 1, r, x, comp); } return -1; } int main() { int Num[8192]; srand(time(NULL)); for (int i = 0; i < 8192; i++) { Num[i] = rand() % 10001; } clock_t starting_time = clock(); bubbleSort(Num, 8192); clock_t ending_time = clock(); clock_t result =…
int sum, k, i, j; int x[4] [4]={5,6,7,8},{1,2,3,4},{9,8,7,3},{2,1,7,1}; sum=0; for (i=1; i x[i-1][j] ) sum++; Give the value of sum after the statements are executed.
In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.