1 answer
2
What is the best case and worst case of the algorithm? And when will best case and worst case will happen??int main() { for(i=1 ; i<=n ; i++) { if(n%i == 0) { for(j=1 ; j...
1 answer
12
construct DFA which do not contain 11 as sub string but end with 0