Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #72.8K
1 Posted Topic
I am taking a computer science course and it is very basic. My question: If an algorithm takes 5n log2 n + 3n^2 + 4n+ 500 steps in the worse case state its complexity using Big- Oh Notation. I don't have any clue on how to solve this problem. Any …
The End.