-
Notifications
You must be signed in to change notification settings - Fork 4
/
wordCounter.cpp
43 lines (36 loc) · 1.25 KB
/
wordCounter.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
/*
Given two arrays of chars, find out how many times dose the bigger array that represents a sentance contain the smaller array that represents a word.
*/
#include <iostream>
using namespace std;
bool checkSentence(char sentence[], int sentenceLength, char word[],int wordLength, int position)
{
for (int i = 0; i < wordLength && sentence[i + position + 1] != ' ' && sentence[i + position + 1] != '.' && position <= 200; i++)
if (sentence[i + position] != word[i])
return false;
return true;
}
int wordCounter(char sentence[], int sentenceLength, char word[], int wordLength)
{
int counter = 0;
for (int i = 0; i < sentenceLength; i++)
{
if (sentence[i] == word[i])
if (checkSentence(sentence, sentenceLength, word, wordLength, i) == true)
counter++;
}
return counter;
}
int main()
{
const int sentenceLength = 200, wordLength = 7;
char sentence[sentenceLength] = { "The Old Bridge in Mostar is not the only bridge."};
char word[wordLength] = { "bridge" };
cout << "Number of times that the word is contained in the sentance: " << wordCounter(sentence, sentenceLength, word, wordLength) << endl;
system("PAUSE");
return 0;
}
//
// Created by Muhamed Karajic on January 27, 2018.
// Copyright © 2018 Muhamed Karajic. All rights reserved.
//