Home Forums SQL Server 7,2000 T-SQL O(n) , O(n log n), O(n^2) RE: O(n) , O(n log n), O(n^2)

  • June 13, 2009 at 12:32 pm

    #1009146

    Jeff Moden (6/13/2009)

    You're absolutely correct and preaching to the choir. I should have just said that it was O(n2) and left it at that because that would have been the correct thing to do.

    Still, a triangular join will beat a square join by a factor of two every time. 😛

    Heh. Thanks, now I have to spend the rest of the day coming up with a count-example? 😛

    [font="Times New Roman"]-- RBarryYoung[/font], [font="Times New Roman"] (302)375-0451[/font] blog: MovingSQL.com, Twitter: @RBarryYoung[font="Arial Black"]
    Proactive Performance Solutions, Inc.     [/font]    [font="Verdana"] "Performance is our middle name."[/font]