C++

Forum

 
alphabet

jlillie89 (403)
Hey I have to output in alphabetical order. It was working when I did it on a test file which was less then this one
This is what I got for output
Letter Count Frequency
====== ===== =========
A 18 ************************************
B 1 **
C 6 ************
D 9 ******************
E 39 ******************************************************************************
F 13 **************************
G 12 ************************
H 21 ******************************************
I 27 ******************************************************
K 2 ****
L 13 **************************
M 1 **
N 33 ******************************************************************
O 19 **************************************
P 6 ************
Q 2 ****
R 13 **************************
S 19 **************************************
T 31 **************************************************************
U 13 **************************
V 8 ****************
W 5 **********
X 2 ****
Y 8 ****************


This file has 75 words and 321 letters.
The highest frequency is 39.

The file sorted alphabetically:
Funny One Plus Six Ten Do Lets Now Say Stop
Tell This Touch again an and backwards count counting each
eight eight eleven eleven equals finger fingers fingers fingers five
five four friends hand hand hand hand have hold it
left left nine nine of of on pausing pointing prove
quickly right right say say seven seven six ten that
the the the the this three time to try two
up will without you your

Just ignore the stars on the other line it doesn't do it on my output file. 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
 
#include <iomanip>
#include <iostream>
#include <fstream>
#include <string>
using namespace std;

ofstream fout;

// Function to test for Empty file
void peekFile(ifstream &fin)
{	
	char empty;
	// To check if the file is empty
	empty=fin.peek();
	if(empty = fin.eof())
	fout << "No data exists" << endl;
}

// To Print Heading
void print_heading(ifstream &fin)
{
	//Formatting for Heading 
	fout << "Letter " << '\t' << "Count " << '\t'<< "Frequency " << endl;
	fout << setw(6) << setfill('=') << '='  <<'\t' << 
	setw(5) << setfill ('=') << '=' << '\t' << setw(9) 
	<< setfill('=') << '=' << endl;
	
	// Function incase file is empty
	peekFile(fin);
	

}

//Function to remove non - alpha
void onlyAlpha(string& str1)
{	
	string newStr1 ;
	newStr1.reserve(str1.size()); 

	for(string::size_type i = 0; i < str1.size(); i++)
	{	
		if ( isalpha( str1[i] ) ) 
		newStr1.push_back( str1[i] );
	}

	str1 = newStr1;
}

//To fill array of strings
void fillString(ifstream &fin, string inputarray[], const int size)
{
	// Loop to fill input array
	for(int i = 0; size > i; i++)
	{	
		fin >> inputarray[i];
	} 
}

// Function to sort array of strings
void selectionSort(string list[], int size)
{
	int i = 0, j = 0, smallest = 0; 
		string temp ;

	for(i = 0; i < size -1; i++)
	{
		smallest = i;
		
		for(j = i + 1; j < size; j++)
		{
			if(list[j] < list[smallest])
				smallest = j;
		}

		//swap
		temp = list[smallest];
		list[smallest] = list [i];
		list [i] = temp;
	}


}

//Function to fill array with only the words
void onlyWords(string str1[], const int isize, int& countWord)
{	
	//Loop to pass string at index i to onlyAlpha function
	for(int i = 0; i <  isize; i++)
	{
		onlyAlpha(str1[i]);
		if(str1[i].size()>0)
		countWord++;
	}		
}

//Function to fill frequency array
void  fillFrequency(string str1, int freqcount[], const int alphabet)
{		
	for(string::size_type i = 0; i < str1.size(); i++)
	{	
		str1[i] = toupper(str1[i]);
		++(freqcount[str1[i] - 'A']);
	}
}

//Function to display the highest frequency
int highestFreq(int freqcount[], const int alphabet)
{	
	int highestfreq = 0;
	
	for(int i = 0; i < alphabet; i ++)
	{
		if(freqcount[i] > highestfreq)
		{
			 highestfreq = freqcount[i];
		}
	}
		return highestfreq;
}

// Function to format and print 
void  printResults(int freqcount[], const int alphabet)
{	
	for (int i = 0; i < alphabet; i++)
	{
		if (freqcount[i] > 0)
		{
			fout <<' ' << char('A' + i) << setfill(' ')<<setw(9)
			<< freqcount[i] << setw(6);
			for (int j = 0; j < 2 * freqcount[i]; j++)
			{
				fout << '*';
			}
			fout << endl;
		}
	}
			fout << '\n' << endl;
}

//Function to print words ten to a line
void printTen(string inputarray[],const int size, int wordtotal)
{
	fout << "The file sorted alphabetically: " << endl;
	int counter = 0;
	
	// The section of code will permit printing 
	//if the string at position i is not empty
	
	for(int i = 0 ; i < size; i++)
	{	
	// This if encompases the whole section within the loop
		if(inputarray[i] !="")
	  {		counter ++;
		if( counter % 10 !=0 )
		{
		fout << inputarray[i] << ' ';
		}
		if(counter % 10 == 0)
		{
			fout << inputarray[i] << endl;
		}
	  }	
	}
}
	
		
void main()
{	
	ifstream fin;
	fin.open("mp6input.txt");
	fout.open("mp6output.txt");
	int wordCount = 0;
	int letterCount = 0;
	int highfreq = 0;
	const int size = 100;
	string inputarray[size];
	const int alphabet = 26;
	int  freqcount[alphabet] = {0};
	
	// to print heading
	print_heading(fin);
	
	// to fill string array
	fillString(fin, inputarray, size);
	
	// To sort array 
	selectionSort(inputarray, size);
	
	//Only words function
	onlyWords(inputarray, size, wordCount);
	
	// This loop gives words to fillfreqency function from inputarray
	for( string::size_type i = 0; i < size; i++)
	{
		fillFrequency( inputarray[i], freqcount, alphabet);
	}
	
	// Prints the table 
	  printResults(freqcount, alphabet);
	
	 //Loop to total letters
	for( int i = 0; i < alphabet ; i++)
	{
		letterCount += freqcount[i];
	}
	
	//Displays the number of words
	fout << "This file has " << wordCount << " words and "  
	<< letterCount <<" letters. " << endl;
	
	// To display the highest frequency
	highfreq = highestFreq(freqcount, alphabet);
	fout << "The highest frequency is " << highfreq 
	<< "." <<'\n' << endl;
	
	// Print the words 10 to a line
	printTen(inputarray, size, wordCount);

	

system("pause");


}

I don't understand this because like I said when It was run on a smaller sample it was sorted alphabetically.
Doesn't make sense
Thx

jlillie89 (403)
This is so weird because the output is alphabetical up to a certain point

The file sorted alphabetically:
Funny One Plus Six Ten Do Lets Now Say Stop
Tell This Touch again an and backwards count counting each
eight eight eleven eleven equals finger fingers fingers fingers five
five four friends hand hand hand hand have hold it
left left nine nine of of on pausing pointing prove
quickly right right say say seven seven six ten that
the the the the this three time to try two
up will without you your

After the bold it appears to be alphabetical. So strange.
jlillie89 (403)
OK so here is where I'm at the function is sorting correctly because upper case letters come first in ascii I didn't know that. If within my sorting function I convert to lower and compare them I will get rid of this issue. I have tried to do just that and I keep getting an abort window popping up for a string being out of range or something.

I don't see why 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
 
// Function to sort array of strings
void selectionSort(string list[], int size)
{
	int i = 0, j = 0, smallest = 0; 
    string temp ; string str1; string str2;
	
	for(i = 0; i < size -1; i++)
	{
		smallest = i;
		
		for(j = i + 1; j < size; j++)
		{
			str1 = list[j];
			str2 = list[smallest];
			str1[0] = tolower( str1[0]);
			str2[0] = tolower(str2[0]);

			if( str1 < str2)
			{
				smallest = j;
			}
		}

	    //swap
		temp = list[smallest];
		list[smallest] = list [i];
		list [i] = temp;
	}
}
Topic archived. No new replies allowed.