• Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Tim Cooke
  • Campbell Ritchie
  • paul wheaton
  • Ron McLeod
  • Devaka Cooray
Sheriffs:
  • Jeanne Boyarsky
  • Liutauras Vilda
  • Paul Clapham
Saloon Keepers:
  • Tim Holloway
  • Carey Brown
  • Piet Souris
Bartenders:

I want to learn how to Determine the complexity o fthe algorithm.

 
Ranch Hand
Posts: 598
Android Eclipse IDE Ubuntu
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
I want to learn how to Determine the complexity of the algorithms but don't know from where to start? I read DS a little bit but dont know anything about determining the complexity of the Algos. Can someone here guide me to learn that.
 
Ranch Hand
Posts: 55
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
What about Cormen's famous book "Introduction to Algorithms". It's good starting point. IMHO.
Is it what did you want?
It would be better if you could post you algorithm here.
 
Himanshu Gupta
Ranch Hand
Posts: 598
Android Eclipse IDE Ubuntu
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
Thanks Oleg for you reply.

Well I am not looking for finding the complexity of some specific algorithm. What I am aiming at to become able to determine the complexity of algorithms.
 
Bartender
Posts: 2856
10
Firefox Browser Fedora Java
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
The same book Oleg mentioned will tell you to understand complexity of some well known algorithms and also any algorithm in general. But I personally feel that the book is not very beginner type.
Usually space complexity is given less importance these days due to availability of large main memory sizes, virtual memory,etc.
For time complexity,there are two widely used methods, the simple method based on guessing the overall complexity when its known for small input size and the master method based on predefined formulas.
There a nice introductory explanation here .

Hope this helps
 
Don't get me started about those stupid light bulbs.
reply
    Bookmark Topic Watch Topic
  • New Topic