Author Archives: Stoimen

Computer Algorithms: How to Determine the Day of the Week

Posted on April 24, 2012 by Stoimen

Introduction Do you know what day of the week was the day you were born? Monday or maybe Saturday? Well, perhaps you know that. Everybody know the day he’s born on, but do you know what day was the 31st … Continue reading →

Posted in algorithms | Tagged Algorithm, algorithms, Calculating the day of the week, Calendars, Chronology, computer, Computer science, Doomsday rule, February, Gregorian calendar, informatics, Julian calendar, Leap year, month, PHP, Units of time, USD, Year zero | Leave a comment

Computer Algorithms: Boyer-Moore String Searching

Posted on April 17, 2012 by Stoimen

Introduction Have you ever asked yourself which is the algorithm used to find a word after clicking Ctrl+F and typing something? Well I guess you know the answer from the title, but in this article you’ll find out how exactly … Continue reading →

Posted in algorithms | Tagged Boyer–Moore string search algorithm, Boyer–Moore–Horspool algorithm, Computer programming, Computer science, Computing, J Strother Moore, Morris-Pratt algorithm, natural language search, pattern forward, PHP, Rabin-Karp algorithm, Rabin-Karp string search algorithm, Robert S. Boyer, search, search algorithms, String searching algorithm, string searching algorithms, Strlen, Substring | 1 Comment

You think you know … algorithms?

Posted on April 11, 2012 by Stoimen

Note!– By reading this blog you can get the right answers! Loading… The answers will be published a week after the quiz has started!

Posted in quiz | Tagged algorithms, Education, quiz, Super Quiz, weekly quiz | Leave a comment

Computer Algorithms: Morris-Pratt String Searching

Posted on April 9, 2012 by Stoimen

Introduction We saw that neither brute force string searching nor Rabin-Karp string searching are effective. However in order to improve some algorithm, first we need to understand its principles in detail. We know already that brute force string matching is … Continue reading →

Posted in algorithms | Tagged Applied mathematics, Boyer–Moore string search algorithm, Brute-force search, Complexity This algorithm, Computer programming, Computer science, faster string searching algorithms, James H. Morris, Knuth–Morris–Pratt algorithm, Lorem ipsum, Morris-Pratt algorithm, PHP, Rabin, Rabin-Karp algorithm, Rabin-Karp string search algorithm, search algorithms, String searching algorithm, Vaughan Pratt | Leave a comment

Computer Algorithms: Rabin-Karp String Searching

Posted on April 2, 2012 by Stoimen

Introduction Brute force string matching is the a very basic sub-string matching algorithm, but it’s good for some reasons. For example it doesn’t require preprocessing of the text or the pattern. The problem is that it’s very slow. That is … Continue reading →

Posted in algorithms | Tagged ASCII, basic sub-string matching algorithm, Boyer–Moore string search algorithm, Complexity The Rabin-Karp algorithm, Cryptographic hash function, Cryptography, Hash function, Hash table, Hashing, Michael O. Rabin, PHP, Rabin-Karp algorithm, Rabin-Karp string search algorithm, Richard M. Karp, Rolling hash, search algorithms, string matching algorithms, String searching algorithm, string searching algorithms, sub-string matching algorithms, This algorithm | 5 Comments