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:
Spring Cloud – Securing Services
Get the workstation name or IP
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular
Java Program to Implement Sorted Circular Doubly Linked List
Java Program to Implement Self organizing List
Registration with Spring Security – Password Encoding
Custom HTTP Header with the HttpClient
Java Program to Implement Bloom Filter
Java – Write to File
Spring WebClient Filters
Java Program to Implement Dijkstra’s Algorithm using Priority Queue
Wiring in Spring: @Autowired, @Resource and @Inject
Java Program to Generate All Possible Combinations of a Given List of Numbers
Java Program to Generate Randomized Sequence of Given Range of Numbers
A Guide to BitSet in Java
Java Program to Find kth Smallest Element by the Method of Partitioning the Array
Java Program to Implement HashMap API
Semaphore trong Java
Java Program to Implement Sorted List
Java Program to Solve the Fractional Knapsack Problem
Java Program to Check Cycle in a Graph using Topological Sort
Một số nguyên tắc, định luật trong lập trình
Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself
Java Program to Implement Shoelace Algorithm
How to Get a Name of a Method Being Executed?
ETL with Spring Cloud Data Flow
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
HttpClient 4 Cookbook
Java Program to Implement Hash Tables chaining with Singly Linked Lists
Iterable to Stream in Java
Java Program to Test Using DFS Whether a Directed Graph is Strongly Connected or Not
Java Program to Compute the Area of a Triangle Using Determinants