Click here to monitor SSC
SQLServerCentral is supported by Red Gate Software Ltd.
Log in  ::  Register  ::  Not logged in
Home       Members    Calendar    Who's On

Add to briefcase «««12345

O(n) , O(n log n), O(n^2) Expand / Collapse
Posted Saturday, March 16, 2013 10:43 AM



Group: General Forum Members
Last Login: Yesterday @ 7:50 PM
Points: 22,418, Visits: 35,492
karthik M (3/16/2013)
Hello All,

I just refreshed all my posts.

This is a very old post (asked on 2009) :)

How to identify whether a code fall under O(n) / O (n2) / O(n log n) by seeing the code ?

Most of us don't try and analyze our code to determine if it is O(n), O(n^2), or O(n log n). We test our code against expect data loads, and then unexpected loads (the million row test) and tune our code appropriately to achieve a scalable solution.

Lynn Pettis

For better assistance in answering your questions, click here
For tips to get better help with Performance Problems, click here
For Running Totals and its variations, click here or when working with partitioned tables
For more about Tally Tables, click here
For more about Cross Tabs and Pivots, click here and here
Managing Transaction Logs

SQL Musings from the Desert Fountain Valley SQL (My Mirror Blog)
Post #1431914
Posted Saturday, March 16, 2013 12:18 PM



Group: General Forum Members
Last Login: Today @ 2:07 PM
Points: 43,451, Visits: 40,592
karthik M (3/16/2013)
How to identify whether a code fall under O(n) / O (n2) / O(n log n) by seeing the code ?
Should get you started. The list of references and further reading too.

Gail Shaw
Microsoft Certified Master: SQL Server, MVP
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

Post #1431933
« Prev Topic | Next Topic »

Add to briefcase «««12345

Permissions Expand / Collapse