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:

Java Program to Implement WeakHashMap API
Extra Login Fields with Spring Security
Java Program to Implement K Way Merge Algorithm
Reactive WebSockets with Spring 5
How to Read HTTP Headers in Spring REST Controllers
Tiêu chuẩn coding trong Java (Coding Standards)
Spring Autowiring of Generic Types
A Guide to TreeSet in Java
Java Program to Implement Fermat Factorization Algorithm
Java Program to Generate All Subsets of a Given Set in the Gray Code Order
Java Program to Implement the RSA Algorithm
Java Program to Implement ArrayList API
Cơ chế Upcasting và Downcasting trong java
Rate Limiting in Spring Cloud Netflix Zuul
Java Program to Find Minimum Element in an Array using Linear Search
Jackson JSON Views
Java Program to Find SSSP (Single Source Shortest Path) in DAG (Directed Acyclic Graphs)
Inheritance and Composition (Is-a vs Has-a relationship) in Java
Java – InputStream to Reader
Java Program to Implement Variable length array
Difference Between Wait and Sleep in Java
Hướng dẫn Java Design Pattern – Decorator
Unsatisfied Dependency in Spring
Java Program to Convert a Decimal Number to Binary Number using Stacks
New Features in Java 12
Java Program to Check Whether a Directed Graph Contains a Eulerian Path
Serverless Functions with Spring Cloud Function
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
TreeSet và sử dụng Comparable, Comparator trong java
Spring MVC + Thymeleaf 3.0: New Features
Java Program to Implement Sieve Of Eratosthenes
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm