• karthikeyan (6/8/2009)


    Yes Gail...I have studied...But i don't remember the functionality...

    I have reviewed the above mentioed URL, Since there are lot of formula's are there,it is confusing...

    Ok, explain what you do know of Big O notation, since you said you did study it, and what exactly is confusing you and we'll try and fill in from there.

    3) What RHS (right-hand side) function denotes exactly?

    In what context?

    4) What LHS (Left-hand side) function denotes exactly?

    In what context?

    OK, since I couldn't get a copy of Moby Dick, I made my own test data. Here is your test rig Phil, with my test data and my technique, followed by your original approach. Needless to say, my method is nearly linear, but the simple approach grows geometrically:

    5) what are all the method available apart from linear? What is mean by linear method?

    how to know whether my code use linear method?

    Related to Big O notation. An algorithm is linear, or has linear time complexity if the time to process a number of inputs grows linearly with the number of inputs. It would be described as O(n)

    There's lots of complexities other than linear. Logarithmic, geometric, polynomial, exponential, etc.

    Gail Shaw
    Microsoft Certified Master: SQL Server, MVP, M.Sc (Comp Sci)
    SQL In The Wild: Discussions on DB performance with occasional diversions into recoverability

    We walk in the dark places no others will enter
    We stand on the bridge and no one may pass