Question

C++ Language:

TestCase:

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. INPUT OF THE TEST CASE #include 2 #include 1 4 using Words - std::vector; using Word std::string; - 6 7 Words input = {"happy", "achieve", "ceiling", "beige", "species", "eight", "ei", "ie", "cie", "cei", "thei", "thie", "thcie", "thcei", "ten' 10 }; Words follows_rule, violates_rule, inapplicable_rule; 11 12 13 { "achieve", "ceiling", "ie", "cei", "thie", "thcei" }; { "beige", "species", "eight", "ei", "cie", "thei", "thcie" }; { "happy", "ten" }; 14 Words fol lows_rule_expected Words violates_rule_expected 16 Words inapplicable_rule_expected 15 =

Answer 1

CODE Explanation in code Comments :

void sort_i_before_e(Words &input , Words &follows_rule,Words &violates_rule,Words &inapplicable_rule){
   for(int i=0;i<input.size();i++){
       //Find "ei","ie" in the vector
       size_t ie = input[i].find("ie");
       size_t ei = input[i].find("ei");
       if(ie!=string::npos){
           //Rule : if "cie" exits in input[i] then goes violates_rule
           //Rule : if "cie" not exits in input[i] then goes follows_rule
       if(input[i][ie-1]!='c'){
       follows_rule.push_back(input[i]);
       }else{
       violates_rule.push_back(input[i]);
       }
       }else if(ei != string::npos){
           //Rule : if "cei" exits in input[i] then goes follows_rule
           //Rule : if "ei" exits in input[i] then goes violates_rule
       if(input[i][ei-1]=='c'){
       follows_rule.push_back(input[i]);
       }else{
       violates_rule.push_back(input[i]);
       }
       }else{
           //"ei","ie" not exists then goes to inapplicable_rule
       inapplicable_rule.push_back(input[i]);
       }
   }
}

Entire Code :

#include<iostream>
#include<vector>
#include<string>
using namespace std;

using Words = vector<string>;
using Word = string;
void sort_i_before_e(Words &input , Words &follows_rule,Words &violates_rule,Words &inapplicable_rule){
   for(int i=0;i<input.size();i++){
       //Find "ei","ie" in the vector
       size_t ie = input[i].find("ie");
       size_t ei = input[i].find("ei");
       if(ie!=string::npos){
           //Rule : if "cie" exits in input[i] then goes violates_rule
           //Rule : if "cie" not exits in input[i] then goes follows_rule
       if(input[i][ie-1]!='c'){
       follows_rule.push_back(input[i]);
       }else{
       violates_rule.push_back(input[i]);
       }
       }else if(ei != string::npos){
           //Rule : if "cei" exits in input[i] then goes follows_rule
           //Rule : if "ei" exits in input[i] then goes violates_rule
       if(input[i][ei-1]=='c'){
       follows_rule.push_back(input[i]);
       }else{
       violates_rule.push_back(input[i]);
       }
       }else{
           //"ei","ie" not exists then goes to inapplicable_rule
       inapplicable_rule.push_back(input[i]);
       }
   }
       //print vector
   for(int i=0;i<follows_rule.size();i++){
       cout<<follows_rule[i]<<" ";
   }
   cout<<endl;
   for(int i=0;i<violates_rule.size();i++){
       cout<<violates_rule[i]<<" ";
   }
   cout<<endl;
   for(int i=0;i<inapplicable_rule.size();i++){
       cout<<inapplicable_rule[i]<<" ";
   }
   cout<<endl;
}
int main(){
   //Initializing vectors
   Words input = {"happy","achieve","ceiling","beige","species","eight","ei","ie","cie","cei","thei","thie","thcie","thcei","ten"};
   Words follows_rule,violates_rule,inapplicable_rule;
   sort_i_before_e(input,follows_rule,violates_rule,inapplicable_rule);
}

Untitled1 - Dev-C++ 5.11 Eile Edit Search View Project Eecute Iools AStyle Window Help TOM-CCc 4.s.2 4-bit Release (globals e before c.cpp ["] Untitled1 void sorti before e(Words input, Words follows rule, Words violates rule, Words inapplicable rule) Project Classes Debug for(int i-e;i<input.size (); 1++) { size t te - innutlil.find ( "ie" ) input [i]. find ("ei"); size t ei if (ie l = string : impos) { //Rule if ( input [i] [ie -1] ! = 'c ' ){ follows_rule.push_back (in put [i] ) ; : if "cie" not exits in input [il then goes follows rule 18 els violates_rule . push_back (input [i] ) ; 13 }else if(ei 1= string::npos){ 14 Bule if (input [i] [ei -1] -- ' c') { follows_rule.push_back ( input [i] ); els violates rule. push_back ( input [ i] ) ; if "ei" exits in innuti1 then goes violates mule 11 18 21 }else 22 "."ie" not inannlicable Pule.Dush hack(innutlil): applicable_rule 25 Resources Compile Log Debug Find Results Compiler Close Line Col File Message Line 2 Lenath: 976 Done narsing in 0.015 seconds Cot 2 Set 0 Lines 27 Iprect 1056 PM Type here to search ENC 5/2019

Output Follows_rule achieve ceiling ie cei thie thcei Violates_rule : beige species eight ei cie thei thcie Inapplicable_rule : happy ten Input Standard input is empty Time (sec) Memory (KB) Log ID: 74312224 Status Status Detail 0.110741 64 AC NA June 5, 2019 at 3:53 p.m.