Zainab_7 | DaniWeb

Posts

Reputation

Joined 5 Years Ago

Last Seen 5 Years Ago

0 Reputation Points

100% Quality Score

Upvotes Received: 1
Posts with Upvotes: 1
Upvoting Members: 1

Downvotes Received: 0
Posts with Downvotes: 0
Downvoting Members: 0

0 Endorsements

3 Contributions

Ranked #55.0K

Discussions / Questions x 3

2 Post Comments

~1K People Reached

Favorite Forums

Computer Science x 3

3 Posted Topics

	algorithm Big Oh 5 Years Ago 5 Years Ago Share on Facebook Share on Twitter Share on LinkedIn 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) … Computer Science 0 1 377
	Big-Oh algorithms 5 Years Ago 5 Years Ago Share on Facebook Share on Twitter Share on LinkedIn Why Big-Oh is not a good scale for comparing algorithms? Computer Science 0 2 361
	run time algorithm 5 Years Ago 5 Years Ago Share on Facebook Share on Twitter Share on LinkedIn 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 … Computer Science 1 3 580

The End.