• edited by
935 views
1 1 vote

 

```
void f(int n)
{
int i, j, k, m;
for (i=0; i < 100; i ++)
{
for (j = 0; j < n; j++)
{
for (k = 0; k < j; k++)
printf("%d", k);
for (m = 0; m < i; m++)
print("%d", m);
}
}
}
```

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
608
608 views
Shraddha dwevedi asked Nov 24, 2021
608 views
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heapb. Binary max heapc. AVL tree (height balanced ...
1 1 vote
1 1 answer
1.1k
1.1k views
Hira Thakur asked Aug 14, 2016
1,070 views
suppose a problem A reduces to problem B & reduction is done at $O(n^2)$ time.if the problem is solved in $O(n^3)$ time then what about the time of problem A___??$O(n^2)$...
2 2 votes
1 1 answer
543
543 views
Hira Thakur asked Aug 14, 2016
543 views
cosider following set of frequeciesmessage frequenciesa ...
0 0 votes
1 answers 1 answer
497
497 views
amit166 asked Nov 24, 2018
497 views
how many different trees possible with 5 nodes?