In this program I'm currently working on I need help with figuring out: Write a C++ program that reads text from a file called letter_count.txt. The program determines which alphabetic character occurs most frequently in the text and which alphabetic character appears least frequently in the text. Currently, I need help with figuring out how to accumulate a total for the lowercase letters and ignore the special characters. Here is the letter_count.text data: To be, or not to be--that is the question: Whether 'tis nobler in the mind to suffer The slings and arrows of outrageous fortune Or to take arms against a sea of troubles And by opposing end them. To die, to sleep-- No more--and by a sleep to say we end The heartache, and the thousand natural shocks That flesh is heir to. 'Tis a consummation Devoutly to be wished. To die, to sleep-- To sleep--perchance to dream: ay, there's the rub, For in that sleep of death what dreams may come When we have shuffled off this mortal coil, Must give us pause. There's the respect That makes calamity of so long life. For who would bear the whips and scorns of time, Th' oppressor's wrong, the proud man's contumely The pangs of despised love, the law's delay, The insolence of office, and the spurns That patient merit of th' unworthy takes, When he himself might his quietus make With a bare bodkin? Who would fardels bear, To grunt and sweat under a weary life, But that the dread of something after death, The undiscovered country, from whose bourn No traveller returns, puzzles the will, And makes us rather bear those ills we have Than fly to others that we know not of? Thus conscience does make cowards of us all, And thus the native hue of resolution Is sicklied o'er with the pale cast of thought, And enterprise of great pitch and moment With this regard their currents turn awry And lose the name of action. -- Soft you now, The fair Ophelia! -- Nymph, in thy orisons Be all my sins remembered. Here is my code so far: // Lab02.cpp : This program reads from the text found in the file and determines // which letter has occured the most and the least. //Project done by Alisha Erickson #include #include #include #include #include using namespace std; //Function prototypes /*void bubbleSort(char results[], string input);*/ int main() { string input; //To hold the line in the file. ifstream inputFile; //File stream object. const int ALPHABET = 26; char result[ALPHABET] = { 'a' + 1}; char lowerCase; char checkCharacter = 'a'; int count = 0; int letterCount; //Opens the file inputFile.open("letter_count.txt", ios::out); //If it was successfully opened, continue. if (inputFile) { //Reads an item from the file. while (getline(inputFile, input)) //To be or not to be, that is the question; = input; { cout << input << endl; int x = input.size(); for (int i = 0; i < x; i++) //T = input[0] { lowerCase = tolower(input[i]); //t cout << lowerCase << endl; for ( int count = 0; count < 26; count++) //compare t to a { if (lowerCase == 'a' + count) { letterCount[count + ‘a’] = letterCount[count – ‘a’] + 1; } } /* bubbleSort(result, input);*/ } } //Continues on from the last successful read //operation. //Close file. inputFile.close(); } //If an error happens, cout error message. else { cout << "ERROR: The file that was input could not be read."; } return 0; } /* void bubbleSort(char results[], string input) { int maxElement; int index; for (maxElement = - 1; maxElement > 0; maxElement--) { for (index = 0; index < maxElement; index++) { if (results[index] > results[index + 1]) { swap(results[index], results[index + 1]); } } } } */
In this program I'm currently working on I need help with figuring out:
Write a C++ program that reads text from a file called letter_count.txt. The program determines which alphabetic character occurs most frequently in the text and which alphabetic character appears least frequently in the text.
Currently, I need help with figuring out how to accumulate a total for the lowercase letters and ignore the special characters.
Here is the letter_count.text data:
To be, or not to be--that is the question:
Whether 'tis nobler in the mind to suffer
The slings and arrows of outrageous fortune
Or to take arms against a sea of troubles
And by opposing end them. To die, to sleep--
No more--and by a sleep to say we end
The heartache, and the thousand natural shocks
That flesh is heir to. 'Tis a consummation
Devoutly to be wished. To die, to sleep--
To sleep--perchance to dream: ay, there's the rub,
For in that sleep of death what dreams may come
When we have shuffled off this mortal coil,
Must give us pause. There's the respect
That makes calamity of so long life.
For who would bear the whips and scorns of time,
Th' oppressor's wrong, the proud man's contumely
The pangs of despised love, the law's delay,
The insolence of office, and the spurns
That patient merit of th' unworthy takes,
When he himself might his quietus make
With a bare bodkin? Who would fardels bear,
To grunt and sweat under a weary life,
But that the dread of something after death,
The undiscovered country, from whose bourn
No traveller returns, puzzles the will,
And makes us rather bear those ills we have
Than fly to others that we know not of?
Thus conscience does make cowards of us all,
And thus the native hue of resolution
Is sicklied o'er with the pale cast of thought,
And enterprise of great pitch and moment
With this regard their currents turn awry
And lose the name of action. -- Soft you now,
The fair Ophelia! -- Nymph, in thy orisons
Be all my sins remembered.
Here is my code so far:
// Lab02.cpp : This program reads from the text found in the file and determines
// which letter has occured the most and the least.
//Project done by Alisha Erickson
#include <iostream>
#include <fstream>
#include <string>
#include <cctype>
#include <iomanip>
using namespace std;
//Function prototypes
/*void bubbleSort(char results[], string input);*/
int main()
{
string input; //To hold the line in the file.
ifstream inputFile; //File stream object.
const int ALPHABET = 26;
char result[ALPHABET] = { 'a' + 1};
char lowerCase;
char checkCharacter = 'a';
int count = 0;
int letterCount;
//Opens the file
inputFile.open("letter_count.txt", ios::out);
//If it was successfully opened, continue.
if (inputFile)
{
//Reads an item from the file.
while (getline(inputFile, input)) //To be or not to be, that is the question; = input;
{
cout << input << endl;
int x = input.size();
for (int i = 0; i < x; i++) //T = input[0]
{
lowerCase = tolower(input[i]); //t
cout << lowerCase << endl;
for ( int count = 0; count < 26; count++) //compare t to a
{
if (lowerCase == 'a' + count)
{
letterCount[count + ‘a’] = letterCount[count – ‘a’] + 1;
}
}
/* bubbleSort(result, input);*/
}
}
//Continues on from the last successful read
//operation.
//Close file.
inputFile.close();
}
//If an error happens, cout error message.
else
{
cout << "ERROR: The file that was input could not be read.";
}
return 0;
}
/*
void bubbleSort(char results[], string input)
{
int maxElement;
int index;
for (maxElement = - 1; maxElement > 0; maxElement--)
{
for (index = 0; index < maxElement; index++)
{
if (results[index] > results[index + 1])
{
swap(results[index], results[index + 1]);
}
}
}
}
*/
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
