const naiveSearchPatter = (searchPattern, string) => {
const M = searchPattern.length;
const N = string.length;
const indexArray = [];
for (let i = 0; i <= N-M; i++) {
let j;
for (j = 0; j < M; j++) {
if (string[i+j] != searchPattern[j])
break;
}
if (j == M) {
indexArray.push(i)
}
}
return indexArray;
};
console.log(naiveSearchPatter("bc", "abcd"));
Naive Pattern Search Method
![](https://media.dev.to/cdn-cgi/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F908014%2F7380b9e6-bf31-41ae-bc8e-bd379ad2a5c9.jpeg)