Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Brute Force EOS algorithm
Replies: 1   Last Post: Nov 12, 2012 5:25 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]


Posts: 821
Registered: 9/1/10
Brute Force EOS algorithm
Posted: Nov 12, 2012 4:19 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

#define EOS '\0'

void BF(char *x, int m, char *y, int n) {
char *yb;
/* Searching */
for (yb = y; *y != EOS; ++y)
if (memcmp(x, y, m) == 0)
OUTPUT(y - yb);
}
(c) 2012 Brute Force EOS Musatov Algorithm All Rights Reserved
Perpetually, may be posted in the public domain for educational only
purposes.



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.