Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

This is c# code that count the number of characters. My question is that how can

ID: 669923 • Letter: T

Question

This is c# code that count the number of characters.

My question is that how can I count the spaces between the characters with this code?

For example, if I enter the sentence "I am a boy" , then the total number of characters with spaces is gonna be 10.

Can somebody help me? Thank you!

Here is what i got so far.

namespace SentenceAnalyzer

{

class Program

{

static void Main(string[] args)

{

string sentence = Interaction.InputBox("Enter any sentence: ", "Sentence Analyzer");

int aCnt = 0, bCnt = 0, cCnt = 0, dCnt = 0, eCnt = 0, fCnt = 0, gCnt = 0, hCnt = 0, iCnt = 0, jCnt = 0, kCnt = 0, lCnt = 0, mCnt = 0, nCnt = 0, oCnt = 0,

pCnt = 0, qCnt = 0, rCnt = 0, sCnt = 0, tCnt = 0, uCnt = 0, vCnt = 0, wCnt = 0, xCnt = 0, yCnt = 0, zCnt = 0;

int max = 0, min = 0;

char maxChar = ' ', minChar = ' ';

int space = 0;

// Loop though each character in the sentence

for (int count = 0; count < sentence.Length; ++count)

{

switch(sentence[count]) // switch on the current character

{

case 'a':

case 'A': ++aCnt;

if (aCnt > max)

{

max = aCnt;

maxChar = 'a';

}

break;

case 'b':

case 'B': ++bCnt;

if (bCnt > max)

{

max = bCnt;

maxChar = 'b';

}

break;

case 'c':

case 'C': ++cCnt;

if (cCnt > max)

{

max = cCnt;

maxChar = 'c';

}

break;

case 'd':

case 'D': ++dCnt;

if (dCnt > max)

{

max = dCnt;

maxChar = 'd';

}

break;

case 'e':

case 'E': ++eCnt;

if (eCnt > max)

{

max = eCnt;

maxChar = 'e';

}

break;

case 'f':

case 'F': ++fCnt;

if (fCnt > max)

{

max = fCnt;

maxChar = 'f';

}

break;

case 'g':

case 'G': ++gCnt;

if (gCnt > max)

{

max = gCnt;

maxChar = 'g';

}

break;

case 'h':

case 'H': ++hCnt;

if (hCnt > max)

{

max = hCnt;

maxChar = 'h';

}

break;

case 'i':

case 'I': ++iCnt;

if (iCnt > max)

{

max = iCnt;

maxChar = 'i';

}

break;

case 'j':

case 'J': ++jCnt;

if (jCnt > max)

{

max = jCnt;

maxChar = 'j';

}

break;

case 'k':

case 'K': ++kCnt;

if (kCnt > max)

{

max = kCnt;

maxChar = 'k';

}

break;

case 'l':

case 'L': ++lCnt;

if (lCnt > max)

{

max = lCnt;

maxChar = 'l';

}

break;

case 'm':

case 'M': ++mCnt;

if (mCnt > max)

{

max = mCnt;

maxChar = 'm';

}

break;

case 'n':

case 'N': ++nCnt;

if (nCnt > max)

{

max = nCnt;

maxChar = 'n';

}

break;

case 'o':

case 'O': ++oCnt;

if (oCnt > max)

{

max = oCnt;

maxChar = 'o';

}

break;

case 'p':

case 'P': ++pCnt;

if (pCnt > max)

{

max = pCnt;

maxChar = 'p';

}

break;

case 'q':

case 'Q': ++qCnt;

if (qCnt > max)

{

max = qCnt;

maxChar = 'q';

}

break;

case 'r':

case 'R': ++rCnt;

if (rCnt > max)

{

max = rCnt;

maxChar = 'r';

}

break;

case 's':

case 'S': ++sCnt;

if (sCnt > max)

{

max = sCnt;

maxChar = 's';

}

break;

case 't':

case 'T': ++tCnt;

if (tCnt > max)

{

max = tCnt;

maxChar = 't';

}

break;

case 'u':

case 'U': ++uCnt;

if (uCnt > max)

{

max = uCnt;

maxChar = 'u';

}

break;

case 'v':

case 'V': ++vCnt;

if (vCnt > max)

{

max = vCnt;

maxChar = 'v';

}

break;

case 'w':

case 'W': ++wCnt;

if (wCnt > max)

{

max = wCnt;

maxChar = 'w';

}

break;

case 'x':

case 'X': ++xCnt;

if (xCnt > max)

{

max = xCnt;

maxChar = 'x';

}

break;

case 'y':

case 'Y': ++yCnt;

if (yCnt > max)

{

max = yCnt;

maxChar = 'y';

}

break;

case 'z':

case 'Z': ++zCnt;

if (zCnt > max)

{

max = zCnt;

maxChar = 'z';

}

break;

}

}

// start the result string with the first lines

string result = "Your sentence was: "" + sentence + "" ";

result += "The total number of characters: " + (aCnt + bCnt + cCnt + dCnt + eCnt + fCnt + gCnt + hCnt + iCnt + jCnt + kCnt +lCnt + mCnt + nCnt+ oCnt +

pCnt + qCnt + rCnt + sCnt + tCnt + uCnt + vCnt + wCnt+ xCnt + yCnt + zCnt) + " ";

min = max + 1; // set the min to be above the max

// only add 'a' if greater than zero

if (aCnt > 0)

result += "Number of a's " + aCnt + " ";

if (aCnt < min)

{

min = aCnt;

minChar = 'a';

}

if (bCnt > 0)

result += "Number of b's " + bCnt + " ";

if (bCnt < min)

{

min = bCnt;

minChar = 'b';

}

if (cCnt > 0)

result += "Number of c's " + cCnt + " ";

if (cCnt < min)

{

min = cCnt;

minChar = 'c';

}

if (dCnt > 0)

result += "Number of d's " + dCnt + " ";

if (dCnt < min)

{

min = dCnt;

minChar = 'd';

}

if (eCnt > 0)

result += "Number of e's " + eCnt + " ";

if (eCnt < min)

{

min = eCnt;

minChar = 'e';

}

if (fCnt > 0)

result += "Number of f's " + fCnt + " ";

if (fCnt < min)

{

min = fCnt;

minChar = 'f';

}

if (gCnt > 0)

result += "Number of g's " + gCnt + " ";

if (gCnt < min)

{

min = gCnt;

minChar = 'g';

}

if (hCnt > 0)

result += "Number of h's " + hCnt + " ";

if (hCnt < min)

{

min = hCnt;

minChar = 'h';

}

if (iCnt > 0)

result += "Number of i's " + iCnt + " ";

if (iCnt < min)

{

min = iCnt;

minChar = 'i';

}

if (jCnt > 0)

result += "Number of j's " + jCnt + " ";

if (jCnt < min)

{

min = jCnt;

minChar = 'j';

}

if (kCnt > 0)

result += "Number of k's " + kCnt + " ";

if (kCnt < min)

{

min = kCnt;

minChar = 'k';

}

if (lCnt > 0)

result += "Number of l's " + lCnt + " ";

if (lCnt < min)

{

min = lCnt;

minChar = 'l';

}

if (mCnt > 0)

result += "Number of m's " + mCnt + " ";

if (mCnt < min)

{

min = mCnt;

minChar = 'm';

}

if (nCnt > 0)

result += "Number of n's " + nCnt + " ";

if (nCnt < min)

{

min = nCnt;

minChar = 'n';

}

if (oCnt > 0)

result += "Number of o's " + oCnt + " ";

if (oCnt < min)

{

min = oCnt;

minChar = 'o';

}

if (pCnt > 0)

result += "Number of p's " + pCnt + " ";

if (pCnt < min)

{

min = pCnt;

minChar = 'p';

}

if (qCnt > 0)

result += "Number of q's " + qCnt + " ";

if (qCnt < min)

{

min = qCnt;

minChar = 'q';

}

if (rCnt > 0)

result += "Number of r's " + rCnt + " ";

if (rCnt < min)

{

min = rCnt;

minChar = 'r';

}

if (sCnt > 0)

result += "Number of s's " + sCnt + " ";

if (sCnt < min)

{

min = sCnt;

minChar = 's';

}

if (tCnt > 0)

result += "Number of t's " + tCnt + " ";

if (tCnt < min)

{

min = tCnt;

minChar = 't';

}

if (uCnt > 0)

result += "Number of u's " + uCnt + " ";

if (uCnt < min)

{

min = uCnt;

minChar = 'u';

}

if (vCnt > 0)

result += "Number of v's " + vCnt + " ";

if (vCnt < min)

{

min = vCnt;

minChar = 'v';

}

if (wCnt > 0)

result += "Number of w's " + wCnt + " ";

if (wCnt < min)

{

min = wCnt;

minChar = 'w';

}

if (xCnt > 0)

result += "Number of x's " + xCnt + " ";

if (xCnt < min)

{

min = xCnt;

minChar = 'x';

}

if (yCnt > 0)

result += "Number of y's " + yCnt + " ";

if (yCnt < min)

{

min = yCnt;

minChar = 'y';

}

if (zCnt > 0)

result += "Number of z's " + zCnt + " ";

if (zCnt < min)

{

min = zCnt;

minChar = 'z';

}

// Add frequency information to the result

result += " The most frequent character was: " + maxChar;

result += " The least frequent character was: " + minChar;

// print out the result

MessageBox.Show(result, "Sentence Analyzer");

}

}

}

Explanation / Answer

You have to count the char ' ' similar to checking for all the other characters in the code. The modified code that counts characters as well as the number of spaces is provided below:

using System;
namespace SentenceAnalyzer

{

class Program

{

static void Main(string[] args)

{
Console.WriteLine("Enter any sentence");
string sentence = Console.ReadLine();
///string sentence = InputBox("Enter any sentence: ", "Sentence Analyzer");

int aCnt = 0, bCnt = 0, cCnt = 0, dCnt = 0, eCnt = 0, fCnt = 0, gCnt = 0, hCnt = 0, iCnt = 0, jCnt = 0, kCnt = 0, lCnt = 0, mCnt = 0, nCnt = 0, oCnt = 0,

pCnt = 0, qCnt = 0, rCnt = 0, sCnt = 0, tCnt = 0, uCnt = 0, vCnt = 0, wCnt = 0, xCnt = 0, yCnt = 0, zCnt = 0;

int max = 0, min = 0;

char maxChar = ' ', minChar = ' ';

int space = 0;

// Loop though each character in the sentence

for (int count = 0; count < sentence.Length; ++count)

{

switch(sentence[count]) // switch on the current character

{

case ' ':

++space;

break;

case 'a':

case 'A': ++aCnt;

if (aCnt > max)

{

max = aCnt;

maxChar = 'a';

}

break;

case 'b':

case 'B': ++bCnt;

if (bCnt > max)

{

max = bCnt;

maxChar = 'b';

}

break;

case 'c':

case 'C': ++cCnt;

if (cCnt > max)

{

max = cCnt;

maxChar = 'c';

}

break;

case 'd':

case 'D': ++dCnt;

if (dCnt > max)

{

max = dCnt;

maxChar = 'd';

}

break;

case 'e':

case 'E': ++eCnt;

if (eCnt > max)

{

max = eCnt;

maxChar = 'e';

}

break;

case 'f':

case 'F': ++fCnt;

if (fCnt > max)

{

max = fCnt;

maxChar = 'f';

}

break;

case 'g':

case 'G': ++gCnt;

if (gCnt > max)

{

max = gCnt;

maxChar = 'g';

}

break;

case 'h':

case 'H': ++hCnt;

if (hCnt > max)

{

max = hCnt;

maxChar = 'h';

}

break;

case 'i':

case 'I': ++iCnt;

if (iCnt > max)

{

max = iCnt;

maxChar = 'i';

}

break;

case 'j':

case 'J': ++jCnt;

if (jCnt > max)

{

max = jCnt;

maxChar = 'j';

}

break;

case 'k':

case 'K': ++kCnt;

if (kCnt > max)

{

max = kCnt;

maxChar = 'k';

}

break;

case 'l':

case 'L': ++lCnt;

if (lCnt > max)

{

max = lCnt;

maxChar = 'l';

}

break;

case 'm':

case 'M': ++mCnt;

if (mCnt > max)

{

max = mCnt;

maxChar = 'm';

}

break;

case 'n':

case 'N': ++nCnt;

if (nCnt > max)

{

max = nCnt;

maxChar = 'n';

}

break;

case 'o':

case 'O': ++oCnt;

if (oCnt > max)

{

max = oCnt;

maxChar = 'o';

}

break;

case 'p':

case 'P': ++pCnt;

if (pCnt > max)

{

max = pCnt;

maxChar = 'p';

}

break;

case 'q':

case 'Q': ++qCnt;

if (qCnt > max)

{

max = qCnt;

maxChar = 'q';

}

break;

case 'r':

case 'R': ++rCnt;

if (rCnt > max)

{

max = rCnt;

maxChar = 'r';

}

break;

case 's':

case 'S': ++sCnt;

if (sCnt > max)

{

max = sCnt;

maxChar = 's';

}

break;

case 't':

case 'T': ++tCnt;

if (tCnt > max)

{

max = tCnt;

maxChar = 't';

}

break;

case 'u':

case 'U': ++uCnt;

if (uCnt > max)

{

max = uCnt;

maxChar = 'u';

}

break;

case 'v':

case 'V': ++vCnt;

if (vCnt > max)

{

max = vCnt;

maxChar = 'v';

}

break;

case 'w':

case 'W': ++wCnt;

if (wCnt > max)

{

max = wCnt;

maxChar = 'w';

}

break;

case 'x':

case 'X': ++xCnt;

if (xCnt > max)

{

max = xCnt;

maxChar = 'x';

}

break;

case 'y':

case 'Y': ++yCnt;

if (yCnt > max)

{

max = yCnt;

maxChar = 'y';

}

break;

case 'z':

case 'Z': ++zCnt;

if (zCnt > max)

{

max = zCnt;

maxChar = 'z';

}

break;

}

}

// start the result string with the first lines

string result = "Your sentence was: "" + sentence + "" ";

result += "The total number of characters: " + (aCnt + bCnt + cCnt + dCnt + eCnt + fCnt + gCnt + hCnt + iCnt + jCnt + kCnt +lCnt + mCnt + nCnt+ oCnt +

pCnt + qCnt + rCnt + sCnt + tCnt + uCnt + vCnt + wCnt+ xCnt + yCnt + zCnt + space) + " ";

min = max + 1; // set the min to be above the max

// only add 'a' if greater than zero

if (space > 0)

result += "Number of spaces " + space + " ";
if (aCnt > 0)

result += "Number of a's " + aCnt + " ";

if (aCnt < min)

{

min = aCnt;

minChar = 'a';

}

if (bCnt > 0)

result += "Number of b's " + bCnt + " ";

if (bCnt < min)

{

min = bCnt;

minChar = 'b';

}

if (cCnt > 0)

result += "Number of c's " + cCnt + " ";

if (cCnt < min)

{

min = cCnt;

minChar = 'c';

}

if (dCnt > 0)

result += "Number of d's " + dCnt + " ";

if (dCnt < min)

{

min = dCnt;

minChar = 'd';

}

if (eCnt > 0)

result += "Number of e's " + eCnt + " ";

if (eCnt < min)

{

min = eCnt;

minChar = 'e';

}

if (fCnt > 0)

result += "Number of f's " + fCnt + " ";

if (fCnt < min)

{

min = fCnt;

minChar = 'f';

}

if (gCnt > 0)

result += "Number of g's " + gCnt + " ";

if (gCnt < min)

{

min = gCnt;

minChar = 'g';

}

if (hCnt > 0)

result += "Number of h's " + hCnt + " ";

if (hCnt < min)

{

min = hCnt;

minChar = 'h';

}

if (iCnt > 0)

result += "Number of i's " + iCnt + " ";

if (iCnt < min)

{

min = iCnt;

minChar = 'i';

}

if (jCnt > 0)

result += "Number of j's " + jCnt + " ";

if (jCnt < min)

{

min = jCnt;

minChar = 'j';

}

if (kCnt > 0)

result += "Number of k's " + kCnt + " ";

if (kCnt < min)

{

min = kCnt;

minChar = 'k';

}

if (lCnt > 0)

result += "Number of l's " + lCnt + " ";

if (lCnt < min)

{

min = lCnt;

minChar = 'l';

}

if (mCnt > 0)

result += "Number of m's " + mCnt + " ";

if (mCnt < min)

{

min = mCnt;

minChar = 'm';

}

if (nCnt > 0)

result += "Number of n's " + nCnt + " ";

if (nCnt < min)

{

min = nCnt;

minChar = 'n';

}

if (oCnt > 0)

result += "Number of o's " + oCnt + " ";

if (oCnt < min)

{

min = oCnt;

minChar = 'o';

}

if (pCnt > 0)

result += "Number of p's " + pCnt + " ";

if (pCnt < min)

{

min = pCnt;

minChar = 'p';

}

if (qCnt > 0)

result += "Number of q's " + qCnt + " ";

if (qCnt < min)

{

min = qCnt;

minChar = 'q';

}

if (rCnt > 0)

result += "Number of r's " + rCnt + " ";

if (rCnt < min)

{

min = rCnt;

minChar = 'r';

}

if (sCnt > 0)

result += "Number of s's " + sCnt + " ";

if (sCnt < min)

{

min = sCnt;

minChar = 's';

}

if (tCnt > 0)

result += "Number of t's " + tCnt + " ";

if (tCnt < min)

{

min = tCnt;

minChar = 't';

}

if (uCnt > 0)

result += "Number of u's " + uCnt + " ";

if (uCnt < min)

{

min = uCnt;

minChar = 'u';

}

if (vCnt > 0)

result += "Number of v's " + vCnt + " ";

if (vCnt < min)

{

min = vCnt;

minChar = 'v';

}

if (wCnt > 0)

result += "Number of w's " + wCnt + " ";

if (wCnt < min)

{

min = wCnt;

minChar = 'w';

}

if (xCnt > 0)

result += "Number of x's " + xCnt + " ";

if (xCnt < min)

{

min = xCnt;

minChar = 'x';

}

if (yCnt > 0)

result += "Number of y's " + yCnt + " ";

if (yCnt < min)

{

min = yCnt;

minChar = 'y';

}

if (zCnt > 0)

result += "Number of z's " + zCnt + " ";

if (zCnt < min)

{

min = zCnt;

minChar = 'z';

}

// Add frequency information to the result

result += " The most frequent character was: " + maxChar;

result += " The least frequent character was: " + minChar;

// print out the result

///MessageBox.Show(result, "Sentence Analyzer");
Console.WriteLine(result);

}

}

}

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote