in reply to Re^15: Rapid text searches ( O(log n) time)
in thread Rapid text searches
and this only for a very complex "average case"! So without references it's hearsay.
Anyway it's certainly not O(1), which (AGAIN) means fixed complexity, no matter how big n gets. And this algo isn't even stable and can go havoc up to O(n).
Your playing around with a "hammer" of other peoples toolbox, take their advice and better don't touch ... you might hurt yourself.
Cheers Rolf
UPDATE: Palavra, palavra, palavra - Turkish 8)
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
| A reply falls below the community's threshold of quality. You may see it by logging in. |