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 Find Nearest Neighbor Using Linear Search
Filtering a Stream of Optionals in Java
Java Program to Implement Sparse Matrix
How to Set TLS Version in Apache HttpClient
Creating a Custom Starter with Spring Boot
Java Program to Perform Insertion in a 2 Dimension K-D Tree
Rest Web service: Filter và Interceptor với Jersey 2.x (P2)
Spring Boot - Scheduling
An Intro to Spring Cloud Security
Compact Strings in Java 9
Java Program to Implement Sparse Array
Java Program to Implement ScapeGoat Tree
Java 8 Stream API Analogies in Kotlin
Servlet 3 Async Support with Spring MVC and Spring Security
Convert Hex to ASCII in Java
Java Program to implement Bit Matrix
Spring Boot Tutorial – Bootstrap a Simple Application
Testing an OAuth Secured API with Spring MVC
Luồng Daemon (Daemon Thread) trong Java
Map to String Conversion in Java
Removing all Nulls from a List in Java
Java Program to Implement a Binary Search Algorithm for a Specific Search Sequence
Spring Boot - Unit Test Cases
Notify User of Login From New Device or Location
Spring Data Java 8 Support
Java Program to Implement Meldable Heap
Java Program to implement Associate Array
Java Program to Generate a Graph for a Given Fixed Degree Sequence
Cơ chế Upcasting và Downcasting trong java
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Java Program to find the number of occurrences of a given number using Binary Search approach
Guide to java.util.Formatter