![\"QUIZ5.PNG\"](\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/217707e4754fc74dd915f3cba39d87ea.jpg\")
<\/p>\n#TC1017 #QUIZ5<\/p>\n
So this was hard. This, I must say, is one of my least effective codes written so far, it\u00b4s too long, buuuuuuut it works, so I\u00b4ll take it. Basically the user inputs the word, letter by letter (ineffective!) and then my code displays it the normal way and then reversed, just so the user sees it. Then it compares index by index to check if its the same.<\/p>\n
The function .pushback was helpful for creating vectors of unknown size.<\/p>\n
The real hard part was making it case unsensitive, oh man that took a while. Ken helped me out with a magical function and everything ran just fine. Also, mek sure to #include all necessary modules.<\/p>\n
<\/p>\n
Source Code below:[GitHub Link: https:\/\/github.com\/diegodamy\/Quiz5%5D<\/a><\/p>\n #include <iostream> char DisplayWord (vector<char> word){ \/\/Outputs word in order cout << “Your word: “; vector<char> DisplayWordReversed (vector<char> word){ \/\/Outputs word in inverse order for (int i = word.size()-1; i >=0; i–){ char FindPalindrome (vector<char> word, vector<char> word2){ \/\/Compares indices of tow vectors: normal word and inversed word int ConvertLowerUpper (){ cout << “Please enter letter by <\/p>\n .”<< endl; int i=0; while (1){ if(letter == ‘.’) { }<\/p>\n DisplayWord(word);<\/p>\n vector<char> v2 = DisplayWordReversed(word);<\/p>\n if (FindPalindrome(word,v2) == 1){ }<\/p>\n —————————————————–<\/p>\n #TC1017 #QUIZ5 So this was hard. This, I must say, is one of my least effective codes written so far, it\u00b4s too long, buuuuuuut it works, so I\u00b4ll take it. Basically the user inputs the word, letter by letter (ineffective!) and then my code displays it the normal way and then reversed, just so the … Continue reading Palindroming all day long<\/span><\/a><\/p>\n","protected":false},"author":20,"featured_media":35204,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[209,32],"class_list":["post-35190","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-quiz5","tag-tc1017"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35190","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/20"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=35190"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35190\/revisions"}],"predecessor-version":[{"id":35209,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35190\/revisions\/35209"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/35204"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=35190"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=35190"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=35190"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n#include <vector>
\n#include <stdio.h>
\n#include <ctype.h>
\nusing namespace std;<\/p>\n
\nint size = word.size();
\nvector<char>word1;<\/p>\n
\nfor (int i = 0; i<word.size(); i++){
\ncout << word[i];
\n}
\n}<\/p>\n
\nint size = word.size();
\nvector<char>word2;
\ncout << endl << “Reversed: “;<\/p>\n
\ncout << word[i];
\nword2.push_back(word[i]);
\n}
\nreturn word2; \/\/Returns value od reversed word (vector)
\n}<\/p>\n
\nint size = word.size();
\ncout << endl;
\nfor (int i = 0; i<word.size(); i++){
\nif (word[i] == word2[i]){
\nreturn 1; \/\/If elements of indices match, return true for palindrome
\n} else{
\nreturn 0;
\n}
\n}
\n}<\/p>\n
\nint i=0;
\nchar str[]=”Test String.n”;
\nchar c;
\nwhile (str[i])
\n{
\nc=str[i];
\nputchar (tolower(c));
\ni++;
\n}
\nreturn 0;
\n}
\nint main(){
\nchar letter;<\/p>\n![\"\"](\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/7daf1989a1083a429999f0deced67a0b.jpg\")
<\/div>\n![\"\"](\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/9ef27a16aaf4c975d7dfd173853edfa4.jpg#038;blog=105336245&%23038;post=269&%23038;subd=diegodamy&%23038;ref=&%23038;feed=1\")
<\/div>\n
\ncout << “To stop enter dot: .” << endl;
\nvector<char> word;
\ncout << endl << “Please enter the letters:” << endl;<\/p>\n
\nchar c;<\/p>\n
\ncin >> letter;<\/p>\n
\nbreak;
\n}
\nletter = tolower(letter);
\nword.push_back(letter);<\/p>\n
\ncout << “It is palindrome!” << endl;
\n} else {
\ncout << “It’s not a palindrome.” << endl;
\n}<\/p>\nPhoto Credit: <a href=”https:\/\/www.flickr.com\/photos\/27067946@N00\/26150917136\/”>jfhweb<\/a><\/a>; via <a href=”http:\/\/compfight.com”>Compfight<\/a><\/a>; <a href=”https:\/\/creativecommons.org\/licenses\/by-nc-sa\/2.0\/”>cc<\/a><\/a>;<\/div>\n<\/a> <\/p>\n","protected":false},"excerpt":{"rendered":"