Register

test algorithms

662 views
0 votes
0 votes

just tell me how to check 3,4

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

79
views
1 answers
0 votes
pavan2517 asked 2 days ago
79 views
algorithms
for(int i=n/2;i<=n;i++) for(int j=1;j<=n;j+=n./2) for(int k=1;k<=n;k*=2) x=x+1;what is time complexity 
User Avatar
173
views
1 answers
2 votes
SSR17 asked Apr 25
173 views
algorithms
for (i = 1; i <= N; i++){ for （j= 1;j <= i^2;j=j+i）{ //some code}} how is this O(n^2)? explain in detail and simple terms
User Avatar
328
views
1 answers
0 votes
24aaaa23 asked Oct 1, 2023
328 views
algorithms
Let G1 (V, E) be a connected undirected graph and G2 (V1, E') be the subgraph of G1. Weights are assigned to the edges of G1.W(e) = 0; if ... will be additional time complexity (strict upper bound) to determine if G2 is connected or not.
User Avatar
433
views
1 answers
0 votes
Overflow04 asked Oct 9, 2022
433 views
Algorithms
how O($n^{2}$) in the last.(in the given solution).
User Avatar
Link Copied!