- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
 | I have this Question , I want the answer and show me how to solve it Please : Analyze the running time of the following algorithm using Big-Oh notation maxerea =0; maxpt1 =maxpt2 = maxpt3 =0; for(i =1;i<=n;i++) for(j =i+1;j<=n;j++) for(k =j+1;k<=n;k++){ empty = True; for(l =1;l<=n;l++){ if((l != i) …  |
| | Why Big-Oh is not a good scale for comparing algorithms?  |
| | I see this Question in a diploma in computer science Exam in Algorithm , and i need help to solve it : Algorithm A1 takes n^2 days to solve a problem of size n . Algorithm A2 takes 2^n seconds on the same problem . Detrmine how large of a …  |