Java Program to Perform Naive String Matching

This is a java program to perform Naive String matching algorithm.

Here is the source code of the Java Program to Perform Naive String Matching. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

package com.maixuanviet.setandstring;
 
import java.util.Scanner;
 
public class StringSearchUsingNaiveMethod
{
    private final int BASE;
    private int[]     occurrence;
    private String    pattern;
 
    public StringSearchUsingNaiveMethod(String pattern)
    {
        this.BASE = 256;
        this.pattern = pattern;
        occurrence = new int[BASE];
        for (int c = 0; c < BASE; c++)
            occurrence = -1;
        for (int j = 0; j < pattern.length(); j++)
            occurrence[pattern.charAt(j)] = j;
    }
 
    public int search(String text)
    {
        int n = text.length();
        int m = pattern.length();
        int skip;
        for (int i = 0; i <= n - m; i += skip)
        {
            skip = 0;
            for (int j = m - 1; j >= 0; j--)
            {
                if (pattern.charAt(j) != text.charAt(i + j))
                {
                    skip = Math.max(1, j - occurrence[text.charAt(i + j)]);
                    break;
                }
            }
            if (skip == 0)
                return i;
        }
        return n;
    }
 
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter the main string: ");
        String text = sc.nextLine();
        System.out.print("Enter the string to be searched: ");
        String pattern = sc.nextLine();
        StringSearchUsingNaiveMethod nsm = new StringSearchUsingNaiveMethod(
                pattern);
        int first_occur_position = nsm.search(text);
        System.out.println("The text '" + pattern
                + "' is first found after the " + first_occur_position
                + " position.");
        sc.close();
    }
}

Output:

$ javac StringSearchUsingNaiveMethod.java
$ java StringSearchUsingNaiveMethod
 
Enter the main string: Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel & Device Driver Programming. Our Founder has trained employees of almost all Top Companies in India. Here are few of them: VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium Networks, ST Microelectronics, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Northwest Bank, Mphasis, Tata Elxsi, Tata Communications, Mindtree, Cognizant, mid size IT companies and many Startups. Students from top Universities and colleges such as NIT Trichy, BITS Pilani, University of California, Irvine, University of Texas, Austin & PESIT Bangalore have benefited a lot from these courses as well. The assignments and real time projects for our courses are of extremely high quality with excellent learning curve.
Enter the string to be searched: No. 1 
The text 'No. 1 ' is first found after the 14 position.

Related posts:

Introduction to Project Reactor Bus
Giới thiệu SOAP UI và thực hiện test Web Service
Spring Cloud AWS – Messaging Support
Java Program to Find the GCD and LCM of two Numbers
Java Program to Implement Find all Back Edges in a Graph
Instance Profile Credentials using Spring Cloud
Java Program to Find kth Smallest Element by the Method of Partitioning the Array
Chuyển đổi Array sang ArrayList và ngược lại
Refactoring Design Pattern với tính năng mới trong Java 8
Java Program to Implement HashSet API
Guide to java.util.concurrent.BlockingQueue
Java Program to implement Array Deque
Introduction to Spring Data JPA
Introduction to Spring Cloud Netflix – Eureka
Prevent Brute Force Authentication Attempts with Spring Security
Inheritance and Composition (Is-a vs Has-a relationship) in Java
Practical Java Examples of the Big O Notation
Java Program to Implement Hash Tree
Hướng dẫn Java Design Pattern – Object Pool
Java Program to Implement LinkedBlockingDeque API
Java Program to Check Whether Graph is DAG
Java Program to Compute the Volume of a Tetrahedron Using Determinants
A Guide to LinkedHashMap in Java
Tránh lỗi NullPointerException trong Java như thế nào?
Introduction to Eclipse Collections
Spring Data MongoDB – Indexes, Annotations and Converters
Abstract class và Interface trong Java
Introduction to Spring Cloud CLI
Hướng dẫn Java Design Pattern – Bridge
Java Program to Check Cycle in a Graph using Topological Sort
Guide to the Volatile Keyword in Java
Java Program to Implement Floyd-Warshall Algorithm