Interested to Buy Any Domain ? << Click Here >> for more details...
What is the time complexity T(n) of the following program?
a)
int n, d, i, j;
cin >> n;
for (d=1; d<=n; d++)
for (i=1; i<=d; i++)
for (j=1; j<=n; j += n/10)
cout << d << " " << i << " " << j << endl;
b)
void main()
{ int n, s, t;
cin >> n;
for (s = 1; s <= n/4; s++)
{t = s;
while (t >= 1)
{ cout << s << " " << t << endl;
t--;
}
}
}
c)
void main()
{ int n, r, s, t;
cin >> n;
for (r = 2; r <= n; r = r * 2)
for (s = 1; s <= n/4; s++)
{
t = s;
while (t >= 1)
{
cout << s << " " << t << endl;
t--;
}
}
}
- 3 Answers
- 10858 Views
- CTS, IBM, Infosys, Qatar University, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / arunthathi
1.t(n)=10*n*n*(n+1)/2
2.t(n)={n/4*(n/4)*[(n/4)+1]}/2
| Is This Answer Correct ? | 17 Yes | 6 No |
Answer / rajesh kumar pal
a- (n*n)*log(n).
b- log(n)*log(n).
c-log(n)*log(n)*log(n).
| Is This Answer Correct ? | 5 Yes | 9 No |
i don't know about working of nested for loop can any one help me
Teta-Omeg-Big-Oh Show that f(n) = n2 + 3n3 is ;(n3).
Definition of priority queue was given. We have to implement the priority queue using array of pointers with the priorities given in the range 1..n. The array could be accessed using the variable top. The list corresponding to the array elements contains the items having the priority as the array index. Adding an item would require changing the value of top if it has higher priority than top. Extracting an item would require deleting the first element from the corresponding queue. The following class was given: class PriorityQueue { int *Data[100]; int top; public: void put(int item, int priority); // inserts the item with the given priority. int get(int priority); // extract the element with the given priority. int count(); // returns the total elements in the priority queue. int isEmpty(); // check whether the priority queue is empty or not. }; We had to implement all these class functions.
0 Answers Nagarro, Wollega University,
Min-Max Write an algorithm that finds both the smallest and largest numbers in a list of n numbers and calculate its complexity T(n).
1 Answers Infosys, Qatar University,
Write an algorithm that receives a string and reverses it.
output for printf("printf");
Deriving time complexity of Binary tree and AVL tree, step by step.
Write code for the multiplication of COMPLEX numbers?
what is the best algorithm to sort out unique words from a list of more than 10 million words(1 crore+)? we need the best technique in the terms of execution time.
Write a (n) algorithm that sorts n distinct integers, ranging in size between 1 and kn inclusive, where k is a constant positive integer. (Hint: Use a kn-element array.)
Write A C++ Program To Input A Number Between 20 To 99 And Display Its Numbername?
Display Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 …
C Code 
