for (j = n - 1; j> 0; j = j - 1) Factorial ( n ) { if n=1 for (i = 0; i A[ i+ 1]) return n * Factorial ( n - 1) Temp= A[ i ]; A[ i] = A[ i+ 1]; A[ i+1] = Temp; RecMinimum (A[], I, r) if r-ls1 return min (A[ 1], A[ r ])) else mid = [(ltr)/2] ml = RecMinimum (A, I, mid)
for (j = n - 1; j> 0; j = j - 1) Factorial ( n ) { if n=1 for (i = 0; i A[ i+ 1]) return n * Factorial ( n - 1) Temp= A[ i ]; A[ i] = A[ i+ 1]; A[ i+1] = Temp; RecMinimum (A[], I, r) if r-ls1 return min (A[ 1], A[ r ])) else mid = [(ltr)/2] ml = RecMinimum (A, I, mid)
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
100%
![e) Find the time complexity of the codes shown below:
Factorial ( n )
for (j = n - 1; j> 0; j = j - 1)
{
{
if n= 1
for (i = 0; i<j; i=i+1)
{
if (A[ i]> A[ i+ 1])
{
return 1
else
return n * Factorial ( n - 1)
}
Temp= A[ i ];
RecMinimum (A[], 1, r)
if r-1<1
return min (A[ 1], A[ r ]))
else
A[ i] = A[ i+1];
A[ i+ 1] = Temp;
mid = [(ltr)/2]
ml = RecMinimum (A, I, mid)
m2 = RecMinimum (A, mid+1, r)
return (min(m1,m2))
}
}
Activ](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3d8517f5-478e-42b7-a79d-f94d71dc3834%2Ff45cba18-bc56-4a77-925f-b7133c808b82%2Ffhdcsi_processed.png&w=3840&q=75)
Transcribed Image Text:e) Find the time complexity of the codes shown below:
Factorial ( n )
for (j = n - 1; j> 0; j = j - 1)
{
{
if n= 1
for (i = 0; i<j; i=i+1)
{
if (A[ i]> A[ i+ 1])
{
return 1
else
return n * Factorial ( n - 1)
}
Temp= A[ i ];
RecMinimum (A[], 1, r)
if r-1<1
return min (A[ 1], A[ r ]))
else
A[ i] = A[ i+1];
A[ i+ 1] = Temp;
mid = [(ltr)/2]
ml = RecMinimum (A, I, mid)
m2 = RecMinimum (A, mid+1, r)
return (min(m1,m2))
}
}
Activ
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 4 steps with 1 images
