Answered: { int A[n][n]; for(int i=0;i>A[i][j];…

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

See similar textbooks

Related questions

Question

estimate the time complexity for the following c++program

#include<iostream.h>
const int n=10;
int Fact (int);
void BSort(int A[n][n]);
int main()
{
int A[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>A[i][j];
BSort(A);
cout<<“Factorial = ”<<Fact(n)<<endl;
return 0;
}
int Fact (int n)
{
if(n==1) return 1;
else return n*(Fact(n-1);
}
void BSort(int A[n][n])
{ int temp;
for(int j=0 ; j<n ; j++)
{
for(int i=0 ; i<n-1 ;i++)
{
if(A[i] > A[i+1])
{
temp=A[i];
A[i]=A[i+1];
A[i+1]=temp;
}
}
}
}
//////////// End /////////////

Expert Solution

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