Register

made easy algo complexity
closed

• closed by
218 views
1 votes
1 votes
closed with the note: duplicate QS: https://gateoverflow.in/100616/algorithm

What is the complexity of this code..??

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
srestha asked May 6, 2019
1,286 views
Made Easy Test Series:Algo- Asymptotic Complexity
$1)n^{2019}=O\left (n^{2020} \right )$ $2)O(n^{2019})=O\left (n^{2020} \right )$ Which one is correct?? If $1)$ is correct, why $2)$ not correct?
$1)n^{2019}=O\left (n^{2020} \right )$$2)O(n^{2019})=O\left (n^{2020} \right )$Which one is correct??If $1)$ is correct, why $2)$ not correct?
User Avatar
0 votes
0 votes
1 answer
2
srestha asked May 6, 2019
452 views
Made Easy Test Series: Algo- Mathematical Solution
Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the number of comparisons? will it be $\left ( 5000 \right )^{2}$ or $\left ( 5000 \right )\times 4$. Someone check plz
Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the nu...
User Avatar
0 votes
0 votes
0 answers
4
pbhati asked Jun 12, 2018
338 views
Algo: Time Complexity
What is the time complexity of the following piece of code in the terms of n? $Main()$ { $n=2^{2^k};$ $for(i=1; i<=n; i++)$ { $j=2;$ $while(j<=n)$ { $j=j^2;$ } } }
What is the time complexity of the following piece of code in the terms of n?$Main()${$n=2^{2^k};$$for(i=1; i<=n; i++)${ $j=2;$ $while(j<=n)$ { $j=j^2;$ }}...
User Avatar
Link Copied!