Skip to content

day 12 #128

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
MadhavBahl merged 4 commits into from
Jan 7, 2019
Merged

day 12 #128

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
e4ee89d
day 12
Spreeha Jan 4, 2019
ab1c50c
Update BruteForce.cpp
MadhavBahl Jan 7, 2019
b95e06f
Update KMP.cpp
MadhavBahl Jan 7, 2019
d853523
Merge branch 'master' into day12
MadhavBahl Jan 7, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
35 changes: 35 additions & 0 deletions day12/C++/BruteForce.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
/**
* @date 04/01/18
* @author SPREEHA DUTTA
*/

#include <bits/stdc++.h>
using namespace std;

int search(string s,string w)
{
int i,j;int k=-1;int c=0;
int m=w.length();
int n=s.length();
for(i=0;i<=n-m;i++)
{
for(j=0,c=i;j<m;j++,c++)
if(s[c]!=w[j])
break;
if(j==m)
{
k=i;
break;
}
}
return k;
}
int main()
{
string s,w;
getline(cin,s);
getline(cin,w);
int t=search (w,s);
cout<<"\n"<<t<<endl;
}

67 changes: 67 additions & 0 deletions day12/C++/KMP.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,67 @@
/**
* @date 04/01/18
* @author SPREEHA DUTTA
*/

#include <bits/stdc++.h>
using namespace std;
void calc(string w,int m,int p[])
{
int l=0,i=1;p[0]=0;
while(i<m)
{
if(p[i]==p[l])
{
l++;
p[i]=l;
i++;
}
else
{
if(l!=0)
l=p[l-1];
else
{
p[i]=l;
i++;
}
}
}
}
int search(string s,string w)
{
int i=0,j=0;int k=-1;
int m=w.length();
int n=s.length();
int arr[m];
calc(w,m,arr);
while(i<n)
{
if(w[j]==s[i])
{
j++;
i++;
}
if(j==m)
{
k=i-j;
break;
}
else if(i<n && w[j]!=s[i])
{
if(j!=0)
j=arr[j-1];
else
i++;
}
}
return k;
}
int main()
{
string s,w;
getline(cin,s);
getline(cin,w);
int t=search (w,s);
cout<<"\n"<<t<<endl;
}
47 changes: 47 additions & 0 deletions day12/C++/RabinKarp.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
#include <bits/stdc++.h>
using namespace std;

int search(string s,string w,int q)
{
int i=0,j=0;int k=-1;
int m=w.length();
int n=s.length();
int sc=0,wc=0,h=1;
int d=256;
for(i=0;i<m-1;i++)
h=(h*d)%q;
for(i=0;i<m;i++)
{
wc=(d*wc+w[i])%q;
sc=(d*sc+s[i])%q;
}
for(i=0;i<n-m;i++)
{
if(sc==wc)
{
for(j=0;j<m;j++)
if(s[i+j]!=w[j])
break;
if(j==m)
{
k=i;
break;
}
}
if(i<n-m)
{
sc=(d*(sc-s[i]*h)+s[i+m])%q;
if(sc<0)
sc+=q;
}
}
return k;
}
int main()
{
string s,w;
getline(cin,s);
getline(cin,w);
int t=search (w,s,101);
cout<<"\n"<<t<<endl;
}
170 changes: 170 additions & 0 deletions day12/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -132,6 +132,45 @@ print(subStringSearch("helloworld","hop"))
print(subStringSearch("abcrxyzgf","xyz"))
```

## C++ Implementation

### [Solution](./C++/BruteForce.cpp)

```C++
/**
* @date 04/01/18
* @author SPREEHA DUTTA
*/
#include <bits/stdc++.h>
using namespace std;
int search(string s,string w)
{
int i,j;int k=-1;int c=0;
int m=w.length();
int n=s.length();
for(i=0;i<=n-m;i++)
{
for(j=0,c=i;j<m;j++,c++)
if(s[c]!=w[j])
break;
if(j==m)
{
k=i;
break;
}
}
return k;
}
int main()
{
string s,w;
getline(cin,s);
getline(cin,w);
int t=search (w,s);
cout<<"\n"<<t<<endl;
}
```

### Java Implementation

#### [Solution](./Java/Bruteforce.java)
Expand Down Expand Up @@ -239,6 +278,79 @@ print(kmp("helloworld","hop"))
print(kmp("ABABDABACDABABCABAB","ABABCABAB"))
```

## C++ Implementation

### [Solution](./C++/KMP.cpp)

```C++
/**
* @date 04/01/18
* @author SPREEHA DUTTA
*/

#include <bits/stdc++.h>
using namespace std;
void calc(string w,int m,int p[])
{
int l=0,i=1;p[0]=0;
while(i<m)
{
if(p[i]==p[l])
{
l++;
p[i]=l;
i++;
}
else
{
if(l!=0)
l=p[l-1];
else
{
p[i]=l;
i++;
}
}
}
}
int search(string s,string w)
{
int i=0,j=0;int k=-1;
int m=w.length();
int n=s.length();
int arr[m];
calc(w,m,arr);
while(i<n)
{
if(w[j]==s[i])
{
j++;
i++;
}
if(j==m)
{
k=i-j;
break;
}
else if(i<n && w[j]!=s[i])
{
if(j!=0)
j=arr[j-1];
else
i++;
}
}
return k;
}
int main()
{
string s,w;
getline(cin,s);
getline(cin,w);
int t=search (w,s);
cout<<"\n"<<t<<endl;
}
```

## C) Z Algorithm

Expand All @@ -260,6 +372,64 @@ To Be Added
To Be Added
```

## C++ Implementation

### [Solution](./C++/RabinKarp.cpp)

```C++
/**
* @date 04/01/18
* @author SPREEHA DUTTA
*/
#include <bits/stdc++.h>
using namespace std;

int search(string s,string w,int q)
{
int i=0,j=0;int k=-1;
int m=w.length();
int n=s.length();
int sc=0,wc=0,h=1;
int d=256;
for(i=0;i<m-1;i++)
h=(h*d)%q;
for(i=0;i<m;i++)
{
wc=(d*wc+w[i])%q;
sc=(d*sc+s[i])%q;
}
for(i=0;i<n-m;i++)
{
if(sc==wc)
{
for(j=0;j<m;j++)
if(s[i+j]!=w[j])
break;
if(j==m)
{
k=i;
break;
}
}
if(i<n-m)
{
sc=(d*(sc-s[i]*h)+s[i+m])%q;
if(sc<0)
sc+=q;
}
}
return k;
}
int main()
{
string s,w;
getline(cin,s);
getline(cin,w);
int t=search (w,s,101);
cout<<"\n"<<t<<endl;
}
```

## E) Boyer Moore Algorithm

### JavaScript Implementation
Expand Down