skip to main | skip to sidebar

Computers and Computer Science Searching

8 Eylül 2007 Cumartesi

Main features

  • simplification of the Boyer-Moore algorithm;
  • uses only the bad-character shift;
  • easy to implement;
  • preprocessing phase in O(m+sigma) time and O(sigma) space complexity;
  • searching phase in O(mn) time complexity;
  • very fast in practice for short patterns and large alphabets.
Gönderen pasta zaman: 08:18

Hiç yorum yok:

Yorum Gönder

Sonraki Kayıt Önceki Kayıt Ana Sayfa
Kaydol: Kayıt Yorumları (Atom)

Blog Arşivi

  • ▼  2007 (33)
    • ▼  Eylül (14)
      • Reference and Explanation
      • Main program for timing and testing
      • Brute force string searching
      • Improve by first character search
      • Call C library string match function
      • Improve by low frequency character search
      • Boyer-Moore-Horspool function
      • Main program for Boyer-Moore-Horspool function
      • 5 Types of Popularity for Ranking
      • How Web Search Engines Work
      • Quick Search algorithm
      • Main features
      • Description
      • The C code
    • ►  Ağustos (19)

Blogs

  • Adjustable Speed Control
  • Atom , RSS
  • Ligth Mix
  • Make Money
  • Make Money Fast
  • Pickpocket
  • Praying Mantis
  • Single and 3-Phase Induction Motors Using the PIC
  • The Simpsons Movie