Speed

Jan. 18th, 2002 05:34 pm
ralphmelton: (Default)
[personal profile] ralphmelton
We converted an O(n^2) algorithm to an O(n log n) algorithm.

Doing so sped up this program from 67 minutes to 3 minutes 18 seconds.

We all did a little happy dance.
  • Add Memory
  • Share This Entry
This account has disabled anonymous posting.
If you don't have an account you can create one now.
HTML doesn't work in the subject.
More info about formatting
 
Notice: This account is set to log the IP addresses of everyone who comments.
Links will be displayed as unclickable URLs to help prevent spam.

Profile

ralphmelton: (Default)
ralphmelton
My Website

April 2018

S M T W T F S
1234567
891011121314
151617181920 21
22232425262728
2930     

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Feb. 25th, 2026 05:53 pm
Powered by Dreamwidth Studios