c) Estimate the time complexity for the following C+ program: #include const int n=10; int Fact (int); void BSort(int A[n][n]); int main() void BSort(int A[n][n]) { int temp; for(int j=0; j A[i+1]) for(int i=0;i>A[i][j]; temp=A[i]; A[i)=A[i+1]; A[i+1]=temp; BSort(A); cout<<"Factorial = "<
c) Estimate the time complexity for the following C+ program: #include const int n=10; int Fact (int); void BSort(int A[n][n]); int main() void BSort(int A[n][n]) { int temp; for(int j=0; j A[i+1]) for(int i=0;i>A[i][j]; temp=A[i]; A[i)=A[i+1]; A[i+1]=temp; BSort(A); cout<<"Factorial = "<
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![c) Estimate the time complexity for the following C++ program:
/ Start /III
#include<iostream.h>
const int n=1O;
int Fact (int);
void BSort(int A[n][n]);
int main()
void BSort(int A[n][n])
{ int temp;
for(int j=0; j<n; j++)
for(int i=0 ; i<n-1;i++)
int A[n][n];
if(A[i] > A[i+1])
for(int i=0;i<n;i+)
for(int j=0;j<n;j++)
cin>>A[i][j];
temp=A[i];
A[i)=A[i+1];
A[i+1]=temp;
BSort(A);
cout<<"Factorial = "<<Fact(n)<<endl;
return 0;
int Fact (int n)
End //////////
if(n==1) return 1;
else
return n*(Fact(n-1);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F20fde131-7d5e-4f38-932b-bd077230fcdf%2F410dd7ca-9435-47e3-9437-cba3e6649e9e%2Fea1udr_processed.jpeg&w=3840&q=75)
Transcribed Image Text:c) Estimate the time complexity for the following C++ program:
/ Start /III
#include<iostream.h>
const int n=1O;
int Fact (int);
void BSort(int A[n][n]);
int main()
void BSort(int A[n][n])
{ int temp;
for(int j=0; j<n; j++)
for(int i=0 ; i<n-1;i++)
int A[n][n];
if(A[i] > A[i+1])
for(int i=0;i<n;i+)
for(int j=0;j<n;j++)
cin>>A[i][j];
temp=A[i];
A[i)=A[i+1];
A[i+1]=temp;
BSort(A);
cout<<"Factorial = "<<Fact(n)<<endl;
return 0;
int Fact (int n)
End //////////
if(n==1) return 1;
else
return n*(Fact(n-1);
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
