#include <iostream.h>
#include <conio.h>
#include <string.h>
# define MAX 100
void main()


    {
    char sen[MAX]; //for sentance input
    char srch[MAX]; //for search word input
    int occ=0,cnt=0;
    int plc[100];
    clrscr();
    cout<<("Please Type a Sentence of Your Choice\n");
    cin.getline(sen,'.');
    cout<<("\n Enter a Word To Search\n");
    cin.getline(srch,'.');
    int ln=strlen(srch);
    for(int i=0;i<strlen(sen);i++)
    if(srch[0]==sen[i] && srch[ln-1]==sen[i+ln-1])//if searching word first and last digit matches


        {
        for( int m=1; m<ln; m++)


            {
            if(srch[m]==sen[i+m])//check the inner letters


                    {
                     plc[cnt]=i; //set place equals to i
                     cnt++;
                     if(m==ln-1) //if all secussful till the endof lenght then incremt occ+
                     occ++;
                    }
                    else

                        {
                        occ=0; // else set occ to zero and count to zero
                        cnt=0;
                        break; //break loop
                }

            }

        }

        cout <<"the occurance of word u entered is "<<occ<<" times in the given string"<<endl;
        for(int k=0;k<occ;k++)


            {
            cout<<"the matching string found at "<<plc[k]<<endl;
        }

        getch();
    }

#include <fstream>
#include <iostream>
#include <string>
#include <conio.h>
# define MAX 100
using namespace std;

int main(void)
{
    fstream File;
    char Buffer[1024];    //alternatively string Buffer;
    File.open("textfile.txt", ios::in);
    
    //char sen[MAX]; //for sentance input
    char srch[MAX]; //for search word input
    int occ=0,cnt=0;
    int plc[100];
    int ln=strlen(srch);
    
    cout<<("\n Enter a Word To Search\n");
    cin.getline(srch,'.');
    
        
    
    
    while(!File.eof())
    {
        File.getline(Buffer, sizeof(Buffer));  //alternatively: File >> Buffer;
        cout << Buffer << endl;
        for(int i=0;i<strlen(sen);i++)
        if(srch[0]==Buffer[i] && srch[ln-1]==Buffer[i+ln-1])
                {for( int m=1; m<ln; m++)


            {
            if(srch[m]==Buffer[i+m])//check the inner letters


                    {
                     plc[cnt]=i; //set place equals to i
                     cnt++;
                     if(m==ln-1) //if all secussful till the endof lenght then incremt occ+
                     occ++;
                    }
                    else

                        {
                        occ=0; // else set occ to zero and count to zero
                        cnt=0;
                        break; //break loop
                }}              
                                cout <<"Appeared: "<<occ<<" times"<<endl;
                                      for(int k=0;k<occ;k++)


                                      {
                                      cout<<"Occurrence: "<<plc[k]<<endl;
        }

        getch();
        
        
    }
    
    if ( File == NULL )  
        cout<<"No match was found.\n";  
    
    File.close();
    return (0);
}
}

taatattacc gtgggccgcg caaatttttt ttatatttgg gcctaatggg cctgttggat
gtcggctgcg accaatggaa acgctccctc atcgcttaac aattatgttg tcctctattt
atttctgctg catcagtttt gaattaagaa tgtgggatcc tctggtacat ccatttcctg
aaagcttaca cggcttcaga tgtatgcttg ccatcaaata tcttcagagc ttacagaata
aatattctcc ggacactgtt gggcatgagt ttttgaaaga ttttatctgc atattgcgaa
gtaagaatta tgccgaagcg ttcaatagat acagtaacgt cgttgccaat gtctataaca
cgtcggaggc tcaattacgg gagtcagtac agtctccctg cctctgtccc cactgtccca
gacatgtctt acaagcgaag gtcatggact tacaggccca tgtttcggaa gcccaagata
tacagaatgt atagaagccg tgatgttcct cgtgggtgtg aaggcccatg taaggttcag
tcttatgaac agcgtcatga tatagcccat gtgggtaaag tcatatgtgt ttctgatgtc
actcgtggta atgggctcac acatcgtgtg ggaaagagat tttgtgtaaa gtctgtgtat
gtgttgggga aggtctggat ggatgagaac atcaagacta agaatcacac aaacactgtc
atgttttttt tagttcgtga taggagaccc tatgggactc cccaggattt tggtcaggtt
tttaacatgt atgataatga gcctagtact gcaacagtaa aaaatgataa tagagatcga
taccaagttc ttcgtaaatt tcaagctaca gtgactggag gtcagtatgc aagcaaggag
caagcaatag tcaagaggtt catgaagatt aacaaccatg ttacttacaa tcatcaagag
actgcgaagt acgataacca tacagagaac gctttactgt tgtatatggc atgtactcat
gccagtaatc cagtgtatgc tactttgaaa atcagaatct atttctatga ttctgttcaa
aattaataaa tattgaattt tattatatga gaaaattcta catctattgt ttgaattaca
ttgtacatca catgatcgac tgccctaatt acattgttta tgctaataac ccctaaacta
tacaaatact tcatacactg atatttaaat actcttaaga aatgccaagt ctgaggatgt
aaatgagtcc agattttgca gatcagaaaa cattgatgta ttcccaacgc tttcctcagg
ttgtggttga actgtatttg tactgttatg atatcgtggt ttttcaagaa cggcatcttg
tcgtgttggg atatcttgaa ataaagggga tttgttatcg tccaggtata tacgccattc
tctgcctgag ctgcagtgat gggttcccct gtgcgagaat ccatatgaag cgcaattaag
tcctagatag taagagcagc cgcaaggaag atcaattctc cgcctgcgta ttggtctcct
cttggctatt ttgtgctgga ctttgatggg tacctgagta gagtggcctc gtgagggtga
tgaattctgc attttttagt gcccagtctt tgagtggaga atttttatcc tcatccaagt
actctttata cgacgatgta ggtcctggat tgcataggaa gattgttggg atcccacctt
taatttgaat tggtttcccg tactttgtgt tgctttgcca gtccctttgg gcccccataa
actctttaaa atgctttaga tagtgggggt cgacgtcatc aatgacgttg taccaggcat
cattactgta cacctttgga ctaaggtcca gatgtccaca caaataatta tgtggaccca
tagacctagc ccacatcgtc ttccccgtcc tgctatctcc ttctatgaca atactcatgg
gtctcccatt gcgcgcagcg gcatccctaa cattctcgga aacccagtct tcaagttctt
ttggaacttg gtcgaaagaa gaagaaagaa aaggacaacg aaaaacctct aaaggaggtg
caaagatcct atctaaattg gcatttaaat tatgaaattg taaaacaaaa tcttttggag
ctaactccct aattacatta agagcctccg acttacttcc tgtgttaatt gctttggcgt
aagcatcatt ggctgattgt tgaccccctc tagcagatct tccatcgatc tgaaactcac
cccattcgag ggtgtctccg tccttatcaa tatatgattt gacgtcggag cttgatttag
ctccctgtat gtttggatgg taatgtgctg accttgttgg ggataccaga tcgaagaatc
tcttattcgt gcatctgtat ttcccttcga actggatgag cacatggaga tgagggctcc
catcttcgtg cagttctctg cagattttga tgaatttttt gtttgttaca gtatctagcg
tctttatctg ggcaagggtt tcctcttttg taagacagca tttgggatat gtaagaaaat
aatttttggc atttatttgg aattttctgg gtggtgccat ttgactcagt caatgggtac
caattgagag gatttcattc tactcagggt atcggtacat tggtacccat atatacttgg
ttacctaatg gcataattgt aattttttta tgggcttcca agcggcccac gacta

#include <string>
#include <conio.h>
# define MAX 100
using namespace std;

int main(void)
{
    fstream File;
    char Buffer[1024];    //alternatively string Buffer;
    File.open("textfile.txt", ios::in);
    
    
    char srch[MAX]; //for search word input
    int occ=0,cnt=0;
    int plc[100];
    int ln=strlen(srch);
    
    cout<<("\nSearch pattern: ");
    cin.getline(srch,'.');
    
        
    
    
    while(!File.eof())
    {
        File.getline(Buffer, sizeof(Buffer));  //alternatively: File >> Buffer;
        cout << endl;
        
        for(int i=0;i<strlen(Buffer);i++)
       {
        if(srch[0]==Buffer[i] && srch[ln-1]==Buffer[i+ln-1])
           {for( int m=1; m<ln; m++)
            {

             if(srch[m]==Buffer[i+m])//check the inner letters

                    {
                     plc[cnt]=i; //set place equals to i
                     cnt++;
                    
                     if(m==ln-1) //if all secussful till the endof lenght then incremt occ+
                     occ++;
                       }
                     else

                    {
                       occ=0; // else set occ to zero and count to zero
                       cnt=0;
                       break; //break loop
                    }
             }              
                              
              cout <<"String present: "<<srch<<"\n";
              cout <<"Appeared: "<<occ<<" times"<<endl;
              for(int k=0;k<occ;k++)

                   {
                     cout<<"Occurrence: "<<plc[k]<<endl;
                   }        
        }

        getch();
        
        
    
        
        
        
    }
    
    if ( File == NULL )  
        cout<<"No match was found.\n";  
    
    File.close();
    return (0);
}
}