1. Engineering
  2. Computer Science
  3. for the following parts try to get the best bigo...

Question: for the following parts try to get the best bigo...

Question details

For the following parts, try to get the best Big-O estimate that you can and briefly justify your
answers (3-4 sentences per part). You should also consider running times for all the operations
contained within the loop body (but ignore the running times for initializer, entry condition and
increment).

Part c
int i = 0 ;
int n = 10 ;
int j;
while (i < n) {
i++ ;
j = i ;
while (i < n) {
printf( "hello %d\n" ,
i) ;
i++ ;
}
i = j;
}

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution