please I need help with these two questions: 1. Consider the following algorithm

Question

please I need help with these two questions:

1. Consider the following algorithm:

for ( i = 1 ; i <= 1 . 5 n ; i++)

cout << i ;

for ( i = n ; i >= 1 ; i - - )

cout << i ;

(a) What is the output when n = 2, n = 4, and n = 6?

(b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

2. Consider the following algorithm:

j = 1 ;

while ( j <= n/2) {

i = 1 ;

while ( i <= j ) {

cout << j << i ;

i++;

}

j++;

}

(a) What is the output when n = 6, n = 8, and n = 10?

(b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

Explanation / Answer

Q1.(a).when n=2 output: 12321

          when n=4 output: 1234564321

          when n=6 output: 123456789654321

Q.2(a) when n=6 output: 11 ( after enterkey press) 21 ( after enterkey press) 22 ( after enterkey press) 31( after enterkey press) 32 ( after enterkey press) 33.

when n=8    output: 11 ( after enterkey press) 21 ( after enterkey press) 22 ( after enterkey press) 31( after enterkey press) 32 ( after enterkey press) 33 ( after enterkey press) 41 ( after enterkey press) 42 ( after enterkey press) 43 ( after enterkey press) 44.

when n=10 output: 11 ( after enterkey press) 21 ( after enterkey press) 22 ( after enterkey press) 31( after enterkey press) 32 ( after enterkey press) 33 ( after enterkey press) 41 ( after enterkey press) 42 ( after enterkey press) 43 ( after enterkey press) 44 ( after enterkey press) 51 ( after enterkey press) 52( after enterkey press)53( after enterkey press)54( after enterkey press)55.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.