. Calculate complexity of following code. Also explain best case, average case and worst-case complexity of code
. Calculate complexity of following code. Also explain best case, average case and worst-case complexity of code
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
Q. Calculate complexity of following code. Also explain best case, average case and worst-case complexity of code.
void sort()
{
inti, k, cnt;
for (i = 1; i < n; i++)
{
k = arr[i];
cnt = i - 1;
do
{
arr[cnt + 1] = arr[cnt];
cnt = cnt - 1;
} while (cnt>= 0 &&arr[cnt] > k);
arr[cnt + 1] = k;
}
}
Attaching the image below too.
![(b)
Calculate complexity of following code. Also explain best case, average case and
worst-case complexity of code
void sort()
{
inti, k, cnt;
for (i = 1; i<n; i++)
{
k = arr[i];
cnt = i - 1;
do
{
arr[cnt + 1] = arr[cnt];
cnt = cnt -1;
} while (cnt>= 0 &&arr[cnt] > k);
arr[cnt + 1] = k;
}
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F52f9b6f8-87ca-4d16-9e6f-ffb46f21863c%2Fadc8beab-4553-44f7-8593-38cc9fc0ec5c%2Fwibibc_processed.jpeg&w=3840&q=75)
Transcribed Image Text:(b)
Calculate complexity of following code. Also explain best case, average case and
worst-case complexity of code
void sort()
{
inti, k, cnt;
for (i = 1; i<n; i++)
{
k = arr[i];
cnt = i - 1;
do
{
arr[cnt + 1] = arr[cnt];
cnt = cnt -1;
} while (cnt>= 0 &&arr[cnt] > k);
arr[cnt + 1] = k;
}
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
