Welcome to the Treehouse Community
Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.
Start your free trialEddie Ramirez
5,274 PointsWrite a program that solves word anagrams using fstream. (C++)
Define a struct type called word with two members of type string: original and sorted. Then define an array wordList of type word with size MAXWORDS, where MAXWORDS is a contant of type int initialized to 200000. Read the file words.txt into the array so that wordList[i].original is set to word i+1 from the file. (That means the first word will be read into wordList[0].original and so on.) At the same time wordList[i].sorted should be set to the sorted version of wordList[i].original. For example, if wordList[i].original is "hello" then wordList[i].sorted will be "ehllo".
1 Answer
Steven Parker
231,269 PointsPlease show your code, and provide a link to the course page you are working on. And you wrote "C++", did you mean C#"?