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:
Display Auto-Configuration Report in Spring Boot
Immutable ArrayList in Java
Java Program to Perform Sorting Using B-Tree
Java Program to Perform Cryptography Using Transposition Technique
Java Program to Find Inverse of a Matrix
Java Program to Implement CopyOnWriteArrayList API
Hướng dẫn Java Design Pattern – Chain of Responsibility
Spring Security Authentication Provider
Spring Boot - Hystrix
Guide to Apache Commons CircularFifoQueue
Ways to Iterate Over a List in Java
Java Program to Perform Finite State Automaton based Search
Giới thiệu Java 8
Java Program to Implement Variable length array
Spring Boot - Application Properties
Java Program to Represent Graph Using 2D Arrays
String Initialization in Java
Spring Boot with Multiple SQL Import Files
Java Program to Find Number of Spanning Trees in a Complete Bipartite Graph
Returning Image/Media Data with Spring MVC
Java Program to Generate All Subsets of a Given Set in the Lexico Graphic Order
Java Program to Implement Cartesian Tree
Spring Boot - Batch Service
Java 9 Stream API Improvements
The HttpMediaTypeNotAcceptableException in Spring MVC
Java Web Services – JAX-WS – SOAP
How to Store Duplicate Keys in a Map in Java?
Spring Security Basic Authentication
Hướng dẫn Java Design Pattern – Visitor
Java Program to Convert a Decimal Number to Binary Number using Stacks
Check If a File or Directory Exists in Java
Java Program to Find the Minimum value of Binary Search Tree