0 answers
1
0 answers
2
0 answers
6
find the total number of comparisons-for(j=1;j<=n-1;j++){for(k=j+1;k<=n+1;j++){if(A[j]<A[k])A[j]=A[j]+2;}}so my question is do i need to consider for loop condition compa...
1 answer
9
please explain this how to find the loop using sql
0 answers
10
how to find number of labeled sub graph possible for a graphi dont want to know to formula please tell me the procedure with an example
1 answer
12
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum isO(1)O(n)None
0 answers
15
what is the time complexities of the following code snippets. 1.k=1;i=1;while(k<=n){ i++; k=k+i;} 2.for(i=1;i<=n;++i){ for(j=1;j<n;j=j*2) c=c+1;} 3.m=pow(2...
1 answer
17
Consider these three grammars.$$\begin{array}{|c|c|c|} \hline \textbf{Grammar G1:} & \textbf{Grammar G2:} & \textbf{Grammar G3:} \\ \hline E\rightarrow E+T \mid T & E\r...
1 answer
27
0 answers
28
0 answers
29