Shevek (shevek) wrote,
Shevek
shevek

http://www.theregister.co.uk/2007/08/07/kirix_browser_database/

"We already have clients using it with 100m record data bases," he said. "We can sort a million records in a minute; so if you sort a ten million record data base, it takes ten minutes."

Idiot.


(For non-programmers: No sort algorithm is linear. The best achievable is provably n.log(n). Solve for k: 1 = k.1M.log(1M) ; k = 7.23e-8 ; compute k.10M.log(10M), you get 11.66 minutes not 10)
Subscribe
  • Post a new comment

    Error

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
  • 5 comments