This week's book giveaway is in the Clojure forum.
We're giving away four copies of Clojure in Action and have Amit Rathore and Francis Avila on-line!
See this thread for details.
Win a copy of Clojure in Action this week in the Clojure forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

how to calculate space and time complexity of an algorithm

 
Punit Jain
Ranch Hand
Posts: 1012
2
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
hii, i m sorry if i am asking this in the wrong forum, i didn't found any specific forum for data structure.
can anyone tell me how we analyze an algorithm. also how we calculate the time and space complexity of any algorithm.
(ie. O(logn) for binary search)..
any examples...

Thank you...
 
Peter Johnson
author
Bartender
Posts: 5852
7
Android Eclipse IDE Ubuntu
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
What Google search terms did you use to find out information about this?

Did you find any relevant Wikipedia articles?

(The search term I used found a great Wikipedia article on this topic)
 
Punit Jain
Ranch Hand
Posts: 1012
2
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
actually, i want to know..
how we calculate the complexities?
i mean i have a algorithm (say about of 4 or 5 lines), how do i will calculate complexities??
 
Tim Moores
Bartender
Pie
Posts: 2496
10
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
So you did not try to use Google at all? Why not?
 
Peter Johnson
author
Bartender
Posts: 5852
7
Android Eclipse IDE Ubuntu
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
If I understand you correctly, what you are trying to do is generate a complexity function for an algorithm that you have. If so, the usual way of doing that is to examine the amount of work done to handle the case where the number of objects in the collection to be processed is 1, then 2, then 3, and so on. In other words, you do this by hand, manually calculating each number.

At time, you need only n=1, n=2 and n=n' + 1 (in other words, figure out the value for any given number using one less than that number), but other times you might need more results. Based on the result, you should be able to come up with a mathematical formula that related the number of objects processed to its complexity. I recall that one of my high level math courses in college covered this. And there were several way to determine the formula based on the progression. But it has been a long time and I don't recall the details.
 
I agree. Here's the link: http://aspose.com/file-tools
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic