Algorithmic Complexity + Asymptotic Notations

This is a discussion on Algorithmic Complexity + Asymptotic Notations within the C Programming forums, part of the General Programming Boards category; Hi all, I've been trying to study algorithmic complexity/asymptotic notations from a long time now. I've searched a lot of ...

  1. #1
    root koodoo's Avatar
    Join Date
    Oct 2005
    Location
    a small village faraway in the mountains
    Posts
    28

    Algorithmic Complexity + Asymptotic Notations

    Hi all,

    I've been trying to study algorithmic complexity/asymptotic notations from a long time now. I've searched a lot of tutorials on the internet dealing with the subject, but none of them gave me a clear picture/understanding of the subject.
    Currently I'm studying the topic from the book:
    "Introduction to algorithms"
    ------Thomas H.Cormen
    ------Charles E. Leiserson
    ------Ronald L. Rivest
    ------Clifford Stein

    I'll be highly grateful if anyone could point me to some good tutorials/books from where I should/could study the topic.

    Thanks in anticipation.

  2. #2
    Code Goddess Prelude's Avatar
    Join Date
    Sep 2001
    Posts
    9,796
    Most of the stuff you'll find is dipped in a college math text and run through an arrogant mathematician's brain. This is a layman's introduction to asymptotic notation from the perspective of the average programmer.
    My best code is written with the delete key.

  3. #3
    aoeuhtns
    Join Date
    Jul 2005
    Posts
    581
    And this is an arrogant mathematician's explanation of asymptotic notation from the perspective that the reader would want to know exactly what asymptotic notation says.
    There are 10 types of people in this world, those who cringed when reading the beginning of this sentence and those who salivated to how superior they are for understanding something as simple as binary.

  4. #4
    Registered User
    Join Date
    Jun 2005
    Posts
    6,259
    So what we have is here are examples of catering to the arrogant computer geek ("I can't really understand college mathematics so it must be worthless") and to the arrogant mathematician ("It is correct so it doesn't matter if laymen understand it").

    Both views have their utility, and both views suffer by automatically disregarding the value offered by the other.

  5. #5
    aoeuhtns
    Join Date
    Jul 2005
    Posts
    581
    But I don't think Prelude has the attitude that she can't understand college mathematics, and I don't have the attitude that it doesn't matter if laymen understand it.
    There are 10 types of people in this world, those who cringed when reading the beginning of this sentence and those who salivated to how superior they are for understanding something as simple as binary.

  6. #6
    Registered User
    Join Date
    Jun 2005
    Posts
    6,259
    Quote Originally Posted by Rashakil Fol
    But I don't think Prelude has the attitude that she can't understand college mathematics, and I don't have the attitude that it doesn't matter if laymen understand it.
    I didn't imply that you or Julienne had such an attitude. The links in this tread cater for both sides, and there is a need for both because of arrogance coupled with ignorance on both sides of the fence.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Sorting (asymptotic) complexity problem
    By Petike in forum C++ Programming
    Replies: 8
    Last Post: 01-20-2009, 06:15 AM
  2. Algorithm Complexity
    By logicwonder in forum C Programming
    Replies: 4
    Last Post: 01-09-2006, 05:03 AM
  3. Worst-case complexity of this function?
    By Ariod in forum C Programming
    Replies: 3
    Last Post: 08-17-2005, 02:17 PM
  4. Average asymptotic run time?
    By Ariod in forum C Programming
    Replies: 1
    Last Post: 08-03-2005, 06:47 PM
  5. question on time complexity
    By blue_gene in forum C++ Programming
    Replies: 10
    Last Post: 05-16-2004, 05:09 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21