New to Strings Please help

[varusnyc]

Hello,
I just started learning strings and dont even know how to properly execute simple part of the program that splits phrase of two words with one space in between into 2 separate strings. I realize that substr() need to be used, but words may varie in length so I have to make it initialize first string any length before first space and second string after the space.
For example: "computer science"
into first string "computer" second string "science"
Here's whats being asked of me:
call a function makewords() which receives three parameters: a string which holds the original phrase and two strings to hold the two words. The function will break the string stored in the first parameter (the original sentence) into two words and then store it in one of the parameters.
Note: The function can assume there is exactly one space between the words in the sentence.
For example, if the original sentence holds: "computer science", then the two words are "computer" and "science”.
You should use member functions such as find and substr to help you with this function
Your function, makewords(), should then check if the 2 new strings are equal to each other, and print the appropriate message saying whether or not they are equal.
print out the two words and their sizes.
Here's my starting piece of code:

void makewords(string ,string ,string){
string phrase;
getline(cin,phrase);
string first, second;
 
 
system("pause"); 
}

Any help is appreciated!

[varusnyc]

I was able to solve it, and now Im stuck at new piece of code:
call the function matchexact() passing the two strings. matchexact() will determine how many times the corresponding positions in the two strings hold exactly the same characters. The function will print this value.
For example, if the two strings are "marriage" and "gerbil", then the function matchexact will return 2, since the two strings have the same characters in positions 2 and 5.

My logic is it would be something like this but it doesnt work correctly.

void matchexact(string first, string second){
     int count = 0;
     for (int i = 0; i < ' '; i++){
         if (first[i] == second[i]){
                      count++;
                      }[

What am I doing wrong?

Here's the whole code:

#include <iostream>
#include <string>
#include <cmath>
using namespace std;
void makewords(string ,string ,string);
void matchexact(string, string);
void jointhem(string, string); 
int main (){  
string phrase, first, second;    
makewords(phrase, first ,second);
matchexact(first, second);
jointhem(first, second);
system("pause");
}     
void makewords(string ,string ,string){
int pos, pos2, firstsize, secondsize;
     string phrase, first, second;
     getline(cin,phrase);
     pos = phrase.find(" ", 0);
     first = phrase.substr(0,pos);
     second = phrase.substr(pos+1);
     firstsize = first.length();
     secondsize = second.length();
                if (firstsize == secondsize){
                   cout << "These strings are equal \n";
                }else{
                   cout << "These strings are not equal \n";      
}
cout << "string: " << first << "  size: " << firstsize << endl;
cout << "string: " << second << "  size: " << secondsize << endl;
}
void matchexact(string first, string second){
     int count = 0;
     for (int i = 0; i < ' '; i++){
         if (first[i] == second[i]){
                      count++;
                      }
     }
cout << "count: " << count << endl;
}
 
void jointhem(string first, string second){
      string concave;
      concave = first + second;
      cout << concave << endl;
return;
}
 
 

[vpawizard]

I was able to solve it, and now Im stuck at new piece of code:
call the function matchexact() passing the two strings. matchexact() will determine how many times the corresponding positions in the two strings hold exactly the same characters. The function will print this value.
For example, if the two strings are "marriage" and "gerbil", then the function matchexact will return 2, since the two strings have the same characters in positions 2 and 5.

My logic is it would be something like this but it doesnt work correctly.

void matchexact(string first, string second){
     int count = 0;
     for (int i = 0; i < ' '; i++){
         if (first[i] == second[i]){
                      count++;
                      }[

What am I doing wrong?

Here's the whole code:

#include <iostream>
#include <string>
#include <cmath>
using namespace std;
void makewords(string ,string ,string);
void matchexact(string, string);
void jointhem(string, string); 
int main (){  
string phrase, first, second;    
makewords(phrase, first ,second);
matchexact(first, second);
jointhem(first, second);
system("pause");
}     
void makewords(string ,string ,string){
int pos, pos2, firstsize, secondsize;
     string phrase, first, second;
     getline(cin,phrase);
     pos = phrase.find(" ", 0);
     first = phrase.substr(0,pos);
     second = phrase.substr(pos+1);
     firstsize = first.length();
     secondsize = second.length();
                if (firstsize == secondsize){
                   cout << "These strings are equal \n";
                }else{
                   cout << "These strings are not equal \n";      
}
cout << "string: " << first << "  size: " << firstsize << endl;
cout << "string: " << second << "  size: " << secondsize << endl;
}
void matchexact(string first, string second){
     int count = 0;
     for (int i = 0; i < ' '; i++){
         if (first[i] == second[i]){
                      count++;
                      }
     }
cout << "count: " << count << endl;
}
 
void jointhem(string first, string second){
      string concave;
      concave = first + second;
      cout << concave << endl;
return;
}
 
 

In the loop condition you are comparing i with ' ' (space-ASCII 32). So, the loop runs 32 times irrespective of length of string causing the program to read beyond array boundaries. Instead, you can first determine which of the string is shorter and run the loop, length of shorter string times.