Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

PART 1 - Observing the loops ( 3 + 3 pts ) Find the Big - notations for the following pseudocode snippets with regard to

PART 1- Observing the loops (3+3 pts)
Find the Big- notations for the following pseudocode snippets with regard to n (the size of data). Please note, you must show us how to find both the upper bound and the lower bound, or you will get zero points. You may also use the l'Hopital's trick for your convenience.
A.
// Assuming n is always larger than 10
for (k =0; k < n; k ++){
for (j =10; j < n; j ++){
// code block that takes a constant amount of runtime
}
}
B.
k =1;
do {
j =1;
do {
// code block that takes a constant amount of runtime
j = j *3;
} until (j >=0.5*n); // if j <0.5*n, continue the loop
k = k +1;
} until (k >= n);

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Intelligent Databases Technologies And Applications

Authors: Zongmin Ma

1st Edition

1599041219, 978-1599041216

More Books

Students also viewed these Databases questions