C++
$30-5000 USD
Pagado a la entrega
Synopsis In this project, you'll write code that generates all subsets of a set of chars. The user prepares a file with one char per line. All the chars are distinct, i.e. no char appears on two different lines. Your program reads in this file via the standard input, sorts the chars into ascending order, and then prints out all possible subsets, one subset per line, to standard output. Hints The inequality operators are defined for chars, and you can use them for the sorting part of the project. You may use any sorting technique you like to sort the data, but you must code one yourself. Don't use a standard library function to sort. You can print out the subsets in any order you want, but each subset must itself be sorted. You may want to use vector to store the chars. Also you can iterate templates if you like. For example, if you want to create a vector that contains an integer vector in each position, you can use vector< vector > x; //The symbols > > must be separated by a space in your code, so that //the compiler doesn't interpret them as an input operator. Don't forget that the empty set is also a subset, as well as the whole set itself Files Here's a short program that illustrates how the comparison operators for chars behave. They behave pretty much exactly like you'd expect. For example, a**<a are="" all="" true.="" use="" as="" test="" program.="" an="" implentation="" of="" bit_string="" program="" discussed="" class.="" run="" what="" might="" look="" using="" sample="" input="" file="" gave="" you="" above.="" this="" output="" slightly="" off.="" there="" should="" be="" blank="" line="" at="" very="" beginning="" empty="" but="" for="" some="" reason="" i="" get="" show="" up="" the="" main="" thing="" to="" see="" that="" each="" individual="" subset="" is="" sorted.="" it="" matter="" if="" your="" appear="" in="" a="" different="" order.="" subsets="">< [url removed, login to view] z k kz f fz fk fkz a az ak akz af afz afk afkz pegasus%</a>**
## **<a are="" all="" true.="" use="" as="" test="" program.="" an="" implentation="" of="" bit_string="" program="" discussed="" class.="" run="" what="" might="" look="" using="" sample="" input="" file="" gave="" you="" above.="" this="" output="" slightly="" off.="" there="" should="" be="" blank="" line="" at="" very="" beginning="" empty="" but="" for="" some="" reason="" i="" get="" show="" up="" the="" main="" thing="" to="" see="" that="" each="" individual="" subset="" is="" sorted.="" it="" matter="" if="" your="" appear="" in="" a="" different="" order.="" subsets="">Deliverables</a>**
**<a are="" all="" true.="" use="" as="" test="" program.="" an="" implentation="" of="" bit_string="" program="" discussed="" class.="" run="" what="" might="" look="" using="" sample="" input="" file="" gave="" you="" above.="" this="" output="" slightly="" off.="" there="" should="" be="" blank="" line="" at="" very="" beginning="" empty="" but="" for="" some="" reason="" i="" get="" show="" up="" the="" main="" thing="" to="" see="" that="" each="" individual="" subset="" is="" sorted.="" it="" matter="" if="" your="" appear="" in="" a="" different="" order.="" subsets="">do what it tell you to do and nothig else</a>**
## **<a are="" all="" true.="" use="" as="" test="" program.="" an="" implentation="" of="" bit_string="" program="" discussed="" class.="" run="" what="" might="" look="" using="" sample="" input="" file="" gave="" you="" above.="" this="" output="" slightly="" off.="" there="" should="" be="" blank="" line="" at="" very="" beginning="" empty="" but="" for="" some="" reason="" i="" get="" show="" up="" the="" main="" thing="" to="" see="" that="" each="" individual="" subset="" is="" sorted.="" it="" matter="" if="" your="" appear="" in="" a="" different="" order.="" subsets="">Deadline information</a>**
**<a are="" all="" true.="" use="" as="" test="" program.="" an="" implentation="" of="" bit_string="" program="" discussed="" class.="" run="" what="" might="" look="" using="" sample="" input="" file="" gave="" you="" above.="" this="" output="" slightly="" off.="" there="" should="" be="" blank="" line="" at="" very="" beginning="" empty="" but="" for="" some="" reason="" i="" get="" show="" up="" the="" main="" thing="" to="" see="" that="" each="" individual="" subset="" is="" sorted.="" it="" matter="" if="" your="" appear="" in="" a="" different="" order.="" subsets="">need it done by 11/30/2001</a>**
Nº del proyecto: #2832807