Question

C++ Language, Only the sort_i_before_e func, not included main. Also, plz look at the instructions. use vector.
Write a function, called "sort Lbefore e that can sort words into whether or not they conform to the 1 beforee, except after c rule, See htrps//en.oxtorddictionaries.com/spelling/-before-e-except-after-cl. This function takes 4 references to vectors of strings as parameters . The first vector is the input consisting of lowercase words (only alphabetic charactersl. The next vector should be filled with words that follow the rule The next vector should be filled with words that don't have ie or 'ei in them. The function returns void. You can assume that no word has multiple e's/"ei's in it for simplicity.

Answer 1

Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. Thanks

#include<iostream>

#include <vector>

#include <string>

using Words = std::vector<std::string>;

using Word = std::string;

using namespace std;

Words input ={"happy","achieve","ceiling",

                                                               "beige","species","eight","ei",

                                                               "ie","cie","cei","thei","thie",

                                                               "thcie","thcei","ten"

                                                               };

Words follows_rule,violates_rule,inapplicable_rule;

Words follows_rule_expected={"achieve","ceiling","ie","cei","thie","thcei"};

Words violates_rule_expected={"beige","species","eight","ei","cie","thei","thcie"};

Words inapplicable_rule_expected={"happy","ten"};

//required method

void sort_i_before_e(Words input, Words &follows_rule, Words &violates_rule,Words &not_applicable){

                //looping through each word in input vector

                for(int i=0;i<input.size();i++){

                                string word=input[i];

                                //finding index of 'ie' in word

                                size_t index=word.find("ie");

                                //checking if ie exists

                                if(index!=string::npos){

                                               //exists, checking if c comes before ie

                                               if(index-1 >=0){

                                                               if(word[index-1]=='c'){

                                                                               //c comes before ie, violation

                                                                               violates_rule.push_back(word);

                                                               }else{

                                                                               //nope! follows the rule

                                                                               follows_rule.push_back(word);

                                                               }

                                               }else{

                                                               //no previous character, meaning follows the rule

                                                               follows_rule.push_back(word);

                                               }

                                }

                                //otherwise checking if ei exists

                                else if(word.find("ei")!=string::npos){

                                               //finding index of ei

                                               index=word.find("ei");

                                               if(index-1 >=0){

                                                               //checking if previous character is not c

                                                               if(word[index-1]!='c'){

                                                                               //nope! violation of rule

                                                                               violates_rule.push_back(word);

                                                               }else{

                                                                               //yes, its a c, follows the rule

                                                                               follows_rule.push_back(word);

                                                               }

                                               }else{

                                                               //no previous char, its a violation

                                                               violates_rule.push_back(word);

                                               }

                                }else{

                                               //neither ei or ie exists, not applicable

                                               not_applicable.push_back(word);

                                }

                }

}

//a helper method to print the vector of words for demonstration

void printVector(Words v){

                cout<<"{";

                for(int i=0;i<v.size();i++){

                                cout<<v[i];

                                if(i!=v.size()-1){

                                               cout<<", ";

                                }

                }

                cout<<"}"<<endl;

}

int main(){

                //testing

                sort_i_before_e(input,follows_rule,violates_rule,inapplicable_rule);

                cout<<"Words follow rule expected: ";

                printVector(follows_rule_expected);

                cout<<"Words follow rule got: ";

                printVector(follows_rule);

               

                cout<<"Words violates rule expected: ";

                printVector(violates_rule_expected);

                cout<<"Words violates rule got: ";

                printVector(violates_rule);

               

                cout<<"Words inapplicable rule expected: ";

                printVector(inapplicable_rule_expected);

                cout<<"Words inapplicable rule got: ";

                printVector(inapplicable_rule);

                return 0;

}

/*OUTPUT*/

Words follow rule expected: {achieve, ceiling, ie, cei, thie, thcei}

Words follow rule got: {achieve, ceiling, ie, cei, thie, thcei}

Words violates rule expected: {beige, species, eight, ei, cie, thei, thcie}

Words violates rule got: {beige, species, eight, ei, cie, thei, thcie}

Words inapplicable rule expected: {happy, ten}

Words inapplicable rule got: {happy, ten}