View Single Post
09-12-2009, 06:53 PM
Join Date: May 2009
Just a note, the comparison algorithm is very slow
(N**3); n := str.length. This means that if a string is 5 characters long it will take 125[units], a
has a complexity of
(N**2), and a
(n * log(n)) [best case].
What i'm saying is the comparison will take a _long_ time, so making users wait for the entire article to be scanned and then compared would be silly. I would suggest a [1,2,6,12,24] hour
job (dependent on the server load and processing power) to check and flag/delete any similar articles.
View Public Profile
Send a private message to adamdecaf
Visit adamdecaf's homepage!
Find More Posts by adamdecaf