What you do is create a list of pointers that correspond to the location of each character in the input string. Then sort the pointers in alphabetic order. All you have to do now is sort your substrings in alphabetic order as well and step through each list once, matching as you go.
This might be more efficiently done in C++.
EDIT: How efficient do you need to be? Searching a 100,000-character string for 100,000 10-character substrings took me 57 seconds -
use strict;
use warnings;
my ($input, $str, @str, $t);
$input .= chr(97 + int rand 26) for 1..100000;
for (1..100000) {
$str = '';
$str .= chr(97 + int rand 26) for 1..10;
push @str, $str;
}
$t = time();
for (@str) {
print "$_\n" if index($input, $str) != -1;
}
print time() - $t;
To get noticeably more efficient than this, you really need a lower level language like C++.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.