	[x] Posted via EE Mobile
	Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

Question

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

9.0

Big-Oh notation for algorithm analysis

Asked by jschmuff in Algorithms, Math & Science, Theory

Tags: algorithm, big-oh, big-o, asymptotic notation, notation, analysis, algorithm analysis

I have read multiple threads, edu sites as well as my book on the "Big-Oh" notation. I need to go through my algorithms for basic data structures and produce Big-O expressions for each, but I don't see how I can do this, I feel like the algorithms are lacking information and I am lacking the knowledge for the mathematical point of view on it. Math has never been my strong point and not sure how I even start on this. Here I am just looking for an example I have many algorithms to use here, so ill give an example on one and if someone can please show me how to turn it into a big-o expression I would much appreciate it.

Here is an algorithm example:

Algorithm push(o)
if size() = N then
indicate stack-full error has occured
t <- t + 1
S[t] <- o

since this is a stack we know the run time is 0(1) for this method, but I dont see how I would use big-o notation for figuring out the time on it. I know an example of 0(1) time could be this,

2^100 <= 2^100 * 1, for n >= 1

View the Solution FREE for 30 Days

20091111-EE-VQP-92 - Hierarchy / EE_QW_3_20080625

Hall of Fame

1. ozo83,843
2. Infinity0844,463
3. thehagman38,207
4. JoseParrot36,140
5. objects24,067
6. harfang14,360
7. itsmeandn...14,206
8. NovaDeni...13,795
9. t0t013,180
10. abel12,936
11. ikework10,815
12. imladris10,780
13. CEHJ10,465
14. Interactive...9,090
15. jaime_oliv...8,884
16. pepr8,490
17. d-glitch8,307
18. Idle_Mind7,900
19. cxr7,800
20. angelIII7,580
21. sunnycoder7,480
22. jkr7,200
23. DanRollins7,000
23. DaveHowe7,000
25. mrjoltcola6,966

1. ozo331,240
2. Infinity08166,433
3. JoseParrot84,306
4. sunnycoder55,988
5. thehagman44,707
6. NovaDeni...36,435
7. jaime_oliv...35,561
8. harfang33,497
9. objects33,379
10. Kdo32,208
11. itsmeandn...31,482
12. CEHJ29,418
13. gregoryyo...26,735
14. d-glitch24,177
15. jkr23,914
16. Ray_Pas...22,055
17. sdstuber21,313
18. ikework20,019
19. imladris19,351
20. pepr18,700
21. roussosc16,572
22. evilrix15,367
23. JimBrandley15,188
24. mwvisa115,050
25. angelIII14,818

Big-Oh notation for algorithm analysis

Asked by jschmuff in Algorithms, Math & Science, Theory

Tags: algorithm, big-oh, big-o, asymptotic notation, notation, analysis, algorithm analysis

About this solution