Interested to Buy Any Domain ? << Click Here >> for more details...
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.
- 1 Answers
- 5429 Views
- I also Faced
- E-Mail Answers
Answer Posted / gokul s
n=6:
(1, 1)
(2, 1)
(2, 2)
(3, 1)
(3, 2)
(3, 3)
n=8:
(1, 1)
(2, 1)
(2, 2)
(3, 1)
(3, 2)
(3, 3)
(4, 1)
(4, 2)
(4, 4)
(4, 4)
n=10:
(1, 1)
(2, 1)
(2, 2)
(3, 1)
(3, 2)
(3, 3)
(4, 1)
(4, 2)
(4, 3)
(4, 4)
(5, 1)
(5, 2)
(5, 3)
(5, 4)
(5, 5)
b) Time complexity is ((n/2) * (n/2)+1)/2
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
A* algorithm is based on which search method?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
Which algorithm inverts a complete resolution strategy?
What is meant by a * search algorithm?
What is meant by uniform cost search algorithm?
What is the bidirectional search algorithm?
Define Routing Algorithm?
What is the most efficient way to store 1 million phone numbers memory-wise?
Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.
How does deep learning contrast with other machine learning algorithms?
what is software cycle?give a diagramatic representation
When an algorithm is considered completed?
Name search algorithm technology?
list the types of linked list with aid of diagram?
