Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 2 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Programming Posted 13 Jun 2017 My Price 5.00

This program must be written in c++, and full points go to the answer that works

This program must be written in c++, and full points go to the answer that works and has the best explanation for each line of code.

Write a program that changes an English sentence into "pig Latin". Use the algorithm: To form a pig-latin phrase from an English phrase, tokenize the phrase into words with the function strtok (or other means if you prefer). To translate each English word into a pig-latin word, place the first letter of the English word at the end of the English word and add the letters "ay". You may assume no punctuation marks and that all words have two or more letters.

Answers

(8)
Status NEW Posted 13 Jun 2017 05:06 AM My Price 5.00

-----------

Attachments

file 1497332701-Answer.docx preview (160 words )
#-----------inc-----------lud-----------e &-----------amp-----------;lt-----------;st-----------dio-----------.h&-----------amp-----------;gt-----------; -----------#in-----------clu-----------de -----------&am-----------p;l-----------t;s-----------tri-----------ng.-----------h&a-----------mp;-----------gt;----------- v-----------oid----------- pr-----------int-----------Lat-----------inW-----------ord-----------( c-----------har----------- *w-----------ord----------- );----------- //----------- fu-----------nct-----------ion----------- pr-----------oto-----------typ-----------e -----------int----------- ma-----------in(----------- vo-----------id -----------) -----------{ -----------cha-----------r s-----------ent-----------enc-----------e[ -----------80 -----------]; -----------// -----------sen-----------ten-----------ce -----------inp-----------ut -----------by -----------use-----------r -----------cha-----------r *-----------tok-----------enP-----------tr;----------- //----------- po-----------int-----------er -----------to -----------cur-----------ren-----------t t-----------oke-----------n -----------put-----------s( -----------&qu-----------ot;-----------Ent-----------er -----------a s-----------ent-----------enc-----------e:&-----------quo-----------t; -----------); ----------- fg-----------ets-----------( s-----------ent-----------enc-----------e, -----------80,----------- st-----------din----------- );----------- p-----------uts-----------( &-----------quo-----------t;\-----------nTh-----------e s-----------ent-----------enc-----------e i-----------n p-----------ig -----------Lat-----------in -----------is:-----------&qu-----------ot;----------- );----------- /-----------/ c-----------all----------- fu-----------nct-----------ion----------- st-----------rto-----------k t-----------o a-----------lte-----------r t-----------he -----------sen-----------ten-----------ce ----------- to-----------ken-----------Ptr----------- = -----------str-----------tok-----------(
Not Rated(0)