Data Structyre and Algorithms: Please Solve solve this on emergency basis: For each of the following algorithm, find running Time complexity T(n) and Space complexity S(n). Also show in big-O notation. Code Segment 1 Algorithm Sum int a=23; int b=5; int sum=a+b; cout<
Data Structyre and Algorithms:
Please Solve solve this on emergency basis:
For each of the following
Code Segment 1
Algorithm Sum
int a=23;
int b=5;
int sum=a+b;
cout<<sum;
Code Segment 2
Algorithm convert-temperature-from-fahrenheit-to-celsius
Step 1: Start.
Step 2: Read F.
Step 3: C= (5* (F-32) ) / 9
Step 4: Print C.
Step 5: Stop.
Code Segment 3
Write Linear search algorithm/function from any book or google. And compute its time and space complexity.
Code Segment 4
Algorithm counter
int count = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
count++;
}
return count;
}
Code Segment 5
Algorithm Max (int a[], int size)
int max = a[0];
for (int i = 1; i < size / 2; ++i)
{
if (max < a[i])
max = a[i];
}
for (int j = 1; j <= size * size; ++j)
{
++max;
cout << max;
}
Code Segment 6
Algorithm MultiplyMatrix
for(i = 0; i < n; ++i)
for(j = 0; j < n; ++j)
C[i][j]=0;
for(k = 0; k < n; ++k)
{
c[i][j] = c[i][j] + a[i][k] * b[k][j];
}
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
