[GWILouisaxwzkla]

Don’t know what type of sort you need to use but heres one with bubble sort:

/**************************************************************** * File Name : c:programstempCG.cpp * Date : December,29,2009 * Comments : new project * Compiler/Assembler : Visual C++ 6.0 * Modifications : * * * * * * Program Shell Generated At: 11:37:28 a.m. =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/ #include < iostream > //#include < string.h > //#include < conio.h > //#include < math.h > //#include < iomanip > //#include < ctype.h > using namespace std; void bubbleSort ( int * array , int numberItems ); //main function ****************************** const int MAX_NUMBERS = 20; int main ( ) { int input; int numberOfInputItems; int numberCount = 0; int numbers [ MAX_NUMBERS ]; cout << "Enter number of items to input: "; cin >> numberOfInputItems; int i = 0; while ( i < numberOfInputItems ) { cout << "enter a number: "; cin >> numbers [ i ] ; if ( numbers [ i ] == 1 || numbers [ i ] == 4 || numbers [ i ] == 5 || numbers [ i ] == 12 || numbers [ i ] || numbers [ i ] == 3 ) numberCount ++; i ++; } cout << endl; cout << "The count was " << numberCount << endl << endl; bubbleSort ( numbers , i ); int j = 0; while ( j < i ) { cout << numbers [ j ] << " "; j ++; } } /******************************* FUNCTION DEFINITION ****************************** Name : bubbleSort Parameters : array a(n) int * , numberItems a(n) int Returns: Void type Comments: ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/ void bubbleSort ( int * array , int numberItems ) { int endSortedArray = numberItems - 1; int lastSwapIndex; int temp; while ( endSortedArray > 0 ) //while not at the end of the unsorted array { lastSwapIndex = 0; //save index of the last item swapped int i = 0; //start at the beggining of the unsorted array while ( i < endSortedArray ) //while not in the sorted items { if ( array [ i ] > array [ i + 1 ] ) //if current item is smaller than next , bubble up { //swap array [ i ] and array [ i + 1 ] temp = array [ i ]; array [ i ] = array [ i + 1 ]; array [ i + 1 ] = temp; lastSwapIndex = i; } i ++; } endSortedArray = lastSwapIndex; //reset swap boundry } return; }

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

/**************************************************************** * File Name : c:programstempCG.cpp * Date : December,29,2009 * Comments : new project * Compiler/Assembler : Visual C++ 6.0 * Modifications : * * * * * * Program Shell Generated At: 11:37:28 a.m. =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/     #include < iostream > //#include < string.h > //#include < conio.h > //#include < math.h > //#include < iomanip > //#include < ctype.h >   using namespace std;     void bubbleSort ( int * array , int numberItems );     //main function ******************************   const int MAX_NUMBERS = 20;   int main ( ) {   int input; int numberOfInputItems; int numberCount = 0; int numbers [ MAX_NUMBERS ];   cout << "Enter number of items to input: "; cin >> numberOfInputItems;   int i = 0; while ( i < numberOfInputItems ) { cout << "enter a number: "; cin >> numbers [ i ] ; if ( numbers [ i ] == 1 || numbers [ i ] == 4 || numbers [ i ] == 5 || numbers [ i ] == 12 || numbers [ i ] || numbers [ i ] == 3 ) numberCount ++; i ++; }   cout << endl; cout << "The count was " << numberCount << endl << endl;   bubbleSort ( numbers , i );   int j = 0; while ( j < i ) { cout << numbers [ j ] << " "; j ++; } }   /******************************* FUNCTION DEFINITION ******************************   Name : bubbleSort Parameters :   array a(n) int * , numberItems a(n) int     Returns: Void type Comments:       ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/ void bubbleSort ( int * array , int numberItems ) {   int endSortedArray = numberItems - 1; int lastSwapIndex; int temp; while ( endSortedArray > 0 ) //while not at the end of the unsorted array { lastSwapIndex = 0; //save index of the last item swapped int i = 0; //start at the beggining of the unsorted array while ( i < endSortedArray ) //while not in the sorted items { if ( array [ i ] > array [ i + 1 ] ) //if current item is smaller than next , bubble up { //swap array [ i ] and array [ i + 1 ] temp = array [ i ]; array [ i ] = array [ i + 1 ]; array [ i + 1 ] = temp; lastSwapIndex = i; } i ++; } endSortedArray = lastSwapIndex; //reset swap boundry }       return; }

[GWILouisaxwzkla]

could try:

<br /> <br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : December,29,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 11:37:28 a.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include < iostream ><br /> //#include < string.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> <br /> using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> int input;<br /> int numberOfInputItems;<br /> int numberCount = 0;<br /> <br /> cout << "Enter number of items to input: ";<br /> cin >> numberOfInputItems;<br /> <br /> int i = 0;<br /> while ( i < numberOfInputItems )<br /> {<br /> cout << "enter a number: ";<br /> cin >> input;<br /> if ( input == 1 || input == 4 || input == 5 || input == 12 ||<br /> input == 6 || input == 3 )<br /> numberCount ++;<br /> i ++;<br /> }<br /> <br /> cout << endl;<br /> cout << "The count was " << numberCount << endl;<br /> }<br /> <br />

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

<br /> <br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : December,29,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 11:37:28 a.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include < iostream ><br /> //#include < string.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> <br /> using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> int input;<br /> int numberOfInputItems;<br /> int numberCount = 0;<br /> <br /> cout << "Enter number of items to input: ";<br /> cin >> numberOfInputItems;<br /> <br /> int i = 0;<br /> while ( i < numberOfInputItems )<br /> {<br /> cout << "enter a number: ";<br /> cin >> input;<br /> if ( input == 1 || input == 4 || input == 5 || input == 12 ||<br /> input == 6 || input == 3 )<br /> numberCount ++;<br /> i ++;<br /> }<br /> <br /> cout << endl;<br /> cout << "The count was " << numberCount << endl;<br /> }<br /> <br />

[GWILouisaxwzkla]

I’m not sure what compiler your using but the include file ctype.h has a macro called isspace() that can be called on characters , like:

<br /> char ch = cin.get()<br /> if ( isspace ( ch ) )<br /> {<br /> cout &lt;&lt; &quot;read a space&quot; ;<br /> }<br />

1 2 3 4 5 6 7

<br /> char ch = cin.get()<br /> if ( isspace ( ch ) )<br /> {<br /> cout &lt;&lt; &quot;read a space&quot; ;<br /> }<br />

The definition is listed as

The isspace() function returns non-zero if its argument is some sort of space (i.e. single space, tab, vertical tab, form feed, carriage return, or newline). Otherwise, zero is returned.

from http://www.cppreference.com/wiki/c/string/isspace

[GWILouisaxwzkla]

You pretty much got the idea about library functions. Most C/C++ compilers have a folder named “include” that has a number of “header” files that can be added to a project by using the preprocessor directive “#include” and then the header file in angle brackets ( like #include < iostream.h> ). There are a whole group of standardized header files each with a certain type of pre-built functions. stdio.h ( stands for standard input output ) , for example , has certain functions for input and outputing things to the screen and files. When you include a certaing “header file” you import all the functions in the file to your project , so this can add to your projects size. However , C/C++ is low level enough that you can write many of these functions your self instead of including them , or since many C/C++ have inline assembly language capabilties you can write your own custom set of utilities , if you desire. Many compilers come with executables that allow the user to compile and create their own header files as well. You’ll find C++ to be much more powerful than VB ……..

[GWILouisaxwzkla]

could just do this:

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : September,9,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 6:23:04 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include < stdio.h ><br /> #include < string.h ><br /> #include < stdlib.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> <br /> <br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> char str [ 20 ];<br /> char numberStr [ 10 ];<br /> <br /> strcpy ( str , "c:\data\file" );<br /> <br /> int stringLength = strlen ( str );<br /> <br /> int j = 0;<br /> while ( j < 10 )<br /> {<br /> <br /> itoa ( j , numberStr, 10 );<br /> strcpy ( str + stringLength , numberStr );<br /> printf ( "%s" , str );<br /> printf ( "n" );<br /> FILE * file = fopen ( str , "a" );<br /> //..................<br /> j ++;<br /> }<br /> return 0 ;<br /> }<br /> <br /> <br />

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

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : September,9,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 6:23:04 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include < stdio.h ><br /> #include < string.h ><br /> #include < stdlib.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> <br /> <br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> char str [ 20 ];<br /> char numberStr [ 10 ];<br /> <br /> strcpy ( str , "c:\data\file" );<br /> <br /> int stringLength = strlen ( str );<br /> <br /> int j = 0;<br /> while ( j < 10 )<br /> {<br /> <br /> itoa ( j , numberStr, 10 );<br /> strcpy ( str + stringLength , numberStr );<br /> printf ( "%s" , str  );<br /> printf ( "n" );<br /> FILE * file = fopen ( str , "a" );<br /> //..................<br /> j ++;<br /> }<br /> return 0 ;<br /> }<br /> <br /> <br />

[GWILouisaxwzkla]

Heres some code that does what you want ( maybe you can splice this into your program ):

<br /> <br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : August,10,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 3:17:50 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> <br /> #include < stdio.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> <br /> //using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> //CHANGE FILE NAMES TO WHAT YOU WANT HERE !!!!!!!!!!!!!!!!!!!!!<br /> <br /> FILE * inputFile = fopen ( "c:\programs\data.txt", "r+" );<br /> <br /> FILE * outputFile;<br /> <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> char ch;<br /> char newline = 10;<br /> int commaCount;<br /> <br /> <br /> char fileName [ 50 ] ;<br /> strcpy ( fileName , "c:\programs\" );<br /> <br /> <br /> fileName [ 12 ] = fgetc ( inputFile );<br /> fileName [ 13 ] = fgetc ( inputFile );<br /> fileName [ 14 ] = '.';<br /> fileName [ 15 ] = 't';<br /> fileName [ 16 ] = 'x';<br /> fileName [ 17 ] = 't';<br /> fileName [ 18 ] = 0;<br /> fgetc ( inputFile );<br /> while ( ! feof ( inputFile ) )<br /> {<br /> <br /> <br /> <br /> ch = fgetc ( inputFile );<br /> outputFile = fopen ( fileName , "a" );<br /> commaCount = 0;<br /> while ( ch != newline &#038;& commaCount < 4)<br /> {<br /> if ( ch == ',' )<br /> commaCount ++;<br /> else<br /> fputc ( ch , outputFile );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( ' ' , outputFile );<br /> //flush rest of line<br /> while ( ch != newline )<br /> ch = fgetc ( inputFile );<br /> fclose ( outputFile );<br /> <br /> <br /> <br /> fileName [ 12 ] = fgetc ( inputFile );<br /> fileName [ 13 ] = fgetc ( inputFile );<br /> fileName [ 14 ] = '.';<br /> fileName [ 15 ] = 't';<br /> fileName [ 16 ] = 'x';<br /> fileName [ 17 ] = 't';<br /> fileName [ 18 ] = 0;<br /> fgetc ( inputFile );<br /> }<br /> <br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> <br />

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

<br /> <br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : August,10,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 3:17:50 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> <br /> #include < stdio.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> <br /> //using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> //CHANGE FILE NAMES TO WHAT YOU WANT HERE !!!!!!!!!!!!!!!!!!!!!<br /> <br /> FILE * inputFile  = fopen ( "c:\programs\data.txt", "r+" );<br /> <br /> FILE * outputFile;<br /> <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> char ch;<br /> char newline = 10;<br /> int commaCount;<br /> <br /> <br /> char fileName [ 50 ] ;<br /> strcpy ( fileName , "c:\programs\" );<br /> <br /> <br /> fileName [ 12 ] = fgetc ( inputFile );<br /> fileName [ 13 ] = fgetc ( inputFile );<br /> fileName [ 14 ] = '.';<br /> fileName [ 15 ] = 't';<br /> fileName [ 16 ] = 'x';<br /> fileName [ 17 ] = 't';<br /> fileName [ 18 ] = 0;<br /> fgetc ( inputFile );<br /> while ( ! feof ( inputFile )  )<br /> {<br /> <br /> <br /> <br /> ch = fgetc ( inputFile );<br /> outputFile = fopen ( fileName , "a" );<br /> commaCount = 0;<br /> while ( ch != newline &#038;& commaCount < 4)<br /> {<br /> if ( ch == ',' )<br /> commaCount ++;<br /> else<br /> fputc ( ch , outputFile );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( ' ' , outputFile );<br /> //flush rest of line<br /> while ( ch != newline )<br /> ch = fgetc ( inputFile );<br /> fclose ( outputFile );<br /> <br /> <br /> <br /> fileName [ 12 ] = fgetc ( inputFile );<br /> fileName [ 13 ] = fgetc ( inputFile );<br /> fileName [ 14 ] = '.';<br /> fileName [ 15 ] = 't';<br /> fileName [ 16 ] = 'x';<br /> fileName [ 17 ] = 't';<br /> fileName [ 18 ] = 0;<br /> fgetc ( inputFile );<br /> }<br /> <br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> <br />

[GWILouisaxwzkla]

heres an infix to postfix program I have laying around:

<br /> <br /> #include < conio.h ><br /> #include < math.h ><br /> #include < string.h ><br /> #include < stdlib.h ><br /> #include < stdio.h ><br /> <br /> enum Boolean { False = 0 , True = 1 } ;<br /> const int GREATER = 1 ;<br /> const int NOTGREATER = 0 ;<br /> int cnt = 0 , cntcol = 0 , postcnt = 0 ;<br /> <br /> // <hr class="bbcode_rule" /> struct Stack<br /> {<br /> int info ;<br /> Stack * previous;<br /> } * top;<br /> <br /> // <hr class="bbcode_rule" /> void Push ( int number )<br /> {<br /> Stack * current;<br /> current = new ( Stack ) ;<br /> if ( current == 0 )<br /> {<br /> printf ( "n allocation error!!!!! " );<br /> return;<br /> }<br /> current -> info = number ;<br /> current -> previous = top ;<br /> top = current ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> int Pop ()<br /> {<br /> int temp ;<br /> Stack * current = top;<br /> temp = current -> info ;<br /> top = top -> previous ;<br /> delete current ;<br /> return temp ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> int StackTop ()<br /> {<br /> return top -> info ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> Boolean isEmpty()<br /> {<br /> if ( top == NULL )<br /> return True;<br /> else<br /> return False ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> Boolean isOperand ( char ch )<br /> {<br /> if ( ch >= '0' &#038;& ch <= '9' ) //if is a number<br /> return True;<br /> else<br /> return False ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> void Infix ( char infix[][10])<br /> {<br /> char c ;<br /> while ( c != 13 )<br /> {<br /> c = getch() ;<br /> putch(c);<br /> if ( c >= '0' &#038;& c <= '9' )<br /> {<br /> infix [cnt][cntcol] = c ;<br /> cntcol++ ;<br /> }<br /> else if ( c == '+'|| c == '-'|| c == '*'|| c == '/')<br /> {<br /> infix [cnt][cntcol] = '�' ;<br /> cnt++ ;<br /> infix [cnt][0] = c ;<br /> infix [cnt][1] = '�' ;<br /> cnt++ ;<br /> cntcol = 0 ;<br /> }<br /> else if ( c == 13 )<br /> infix[cnt][cntcol] = '�' ;<br /> }<br /> }<br /> <br /> <br /> // <hr class="bbcode_rule" /> int Calculate (int op1, char opr, int op2)<br /> {<br /> int ans ;<br /> switch ( opr )<br /> {<br /> case '+' : ans = op1 + op2 ; break ;<br /> case '-' : ans = op1 - op2 ; break ;<br /> case '*' : ans = op1 * op2 ; break ;<br /> case '/' : ans = op1 / op2 ; break ;<br /> case '^' : ans = pow(op1, op2) ;<br /> }<br /> return ans ;<br /> }<br /> // <hr class="bbcode_rule" /> int Evaluate ( char postfix[][10] )<br /> {<br /> for ( int i = 0 ; i <= cnt ; i ++ )<br /> {<br /> char ch = postfix<i>[0] ;<br /> char ch1[10] ;<br /> strcpy ( ch1 ,postfix </i><i> ) ;<br /> // cout <<endl<< atoi ( ch1) ;<br /> if ( isOperand ( ch ) == True )<br /> Push ( atoi(ch1) );<br /> else<br /> {<br /> int op2 = Pop () ;<br /> int op1 = Pop () ;<br /> int ans = Calculate ( op1, ch, op2 ) ;<br /> // cout << ans << endl ;<br /> Push ( ans ) ;<br /> }<br /> }<br /> int ans = Pop () ;<br /> return ans ;<br /> }<br /> <br /> // </i> <hr class="bbcode_rule" /> int CheckP (char cur, char st)<br /> {<br /> int a = NOTGREATER ;<br /> <br /> if ( cur == '(' )<br /> a = GREATER ;<br /> else if ( cur != '(' &#038;& st == '(' )<br /> a = GREATER ;<br /> else if ( cur != '(' &#038;& st != '(' )<br /> {<br /> if ( ( cur == '*' || cur == '/' ) &#038;& ( st == '+' || st == '-' ) )<br /> a = GREATER ;<br /> }<br /> return a ;<br /> <br /> }<br /> <br /> <br /> // <hr class="bbcode_rule" /> void infixToPostfix ( char infix[][10], char postfix[][10] )<br /> {<br /> int postcol = 0 ;<br /> for ( int i = 0 ; i <= cnt ; i ++ )<br /> {<br /> // strcpy(postfix<i>, infix </i><i>) ;<br /> // cout << postfix</i><i> ;<br /> char ch;<br /> ch = infix</i><i>[0] ;<br /> if ( isOperand ( ch ) == True )<br /> strcpy ( postfix [postcnt++] , infix </i><i> ) ;<br /> else<br /> {<br /> if ( isEmpty() == True )<br /> Push ( int(ch) ) ;<br /> else<br /> {<br /> while ( CheckP( ch, StackTop() ) != GREATER &#038;& isEmpty() != True )<br /> {<br /> char c ;<br /> if ( ch == ')' )<br /> {<br /> do<br /> {<br /> c = char ( Pop() ) ;<br /> if ( c != '(')<br /> {<br /> postfix [postcnt][postcol] = c ;<br /> postfix [postcnt][postcol+1] = '�' ;<br /> postcnt++ ;<br /> }<br /> }while ( c != '(' &#038;& isEmpty() != True);<br /> break ;<br /> }<br /> else<br /> c = char ( Pop() ) ;<br /> if ( c != '(' &#038;& c != ')' )<br /> {<br /> postfix [postcnt][postcol] = c ;<br /> postfix [postcnt][postcol+1] = '�' ;<br /> postcnt++ ;<br /> }<br /> }<br /> if ( ch != ')' )<br /> Push ( int(ch) ) ;<br /> }<br /> }<br /> }<br /> <br /> while ( isEmpty () != True )<br /> {<br /> char c = char ( Pop () ) ;<br /> postfix [postcnt][postcol] = c ;<br /> postfix [postcnt][postcol+1] = '�';<br /> postcnt++ ;<br /> }<br /> // postfix[postcnt][postcol] = '�';<br /> }<br /> <br /> //</i> <hr class="bbcode_rule" /> void Postfix ( char postfix[][10] )<br /> {<br /> char ch[10] ;<br /> for ( int i = 0; i <= postcnt; i++ )<br /> {<br /> strcpy(ch , postfix<i> ) ;<br /> printf ( "%c" ,ch );<br /> }<br /> }<br /> <br /> // </i> <hr class="bbcode_rule" /> void main()<br /> {<br /> //clrscr();<br /> top = NULL ;<br /> <br /> char infix [ 50 ][ 10 ] ;<br /> char postfix [ 50 ][ 10 ] ;<br /> <br /> //gotoxy ( 5, 8 ) ;<br /> printf ( "Enter Arithematic Expression ...................... : " );<br /> Infix ( infix ) ;<br /> <br /> infixToPostfix ( infix, postfix ) ;<br /> //gotoxy ( 5, 10 ) ;<br /> printf ( "Arithematic Expression in Postfix Notation......... : " );<br /> Postfix ( postfix ) ;<br /> int ans = Evaluate ( postfix ) ;<br /> //gotoxy (5, 11 ) ;<br /> printf ( "The Answer of Expression .......................... : " );<br /> printf ( "%i", ans );<br /> <br /> getch();<br /> }<br /> // <hr class="bbcode_rule" />

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 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266

<br /> <br /> #include < conio.h ><br /> #include < math.h ><br /> #include < string.h ><br /> #include < stdlib.h ><br /> #include < stdio.h ><br /> <br /> enum Boolean { False = 0 , True = 1 } ;<br /> const int GREATER = 1 ;<br /> const int NOTGREATER = 0 ;<br /> int cnt = 0 , cntcol = 0 , postcnt = 0 ;<br /> <br /> // <hr class="bbcode_rule" /> struct Stack<br /> {<br /> int info ;<br /> Stack * previous;<br /> } * top;<br /> <br /> // <hr class="bbcode_rule" /> void Push ( int number )<br /> {<br /> Stack * current;<br /> current = new ( Stack ) ;<br /> if ( current == 0 )<br /> {<br /> printf ( "n allocation error!!!!! " );<br /> return;<br /> }<br /> current -> info = number ;<br /> current -> previous = top ;<br /> top = current ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> int Pop ()<br /> {<br /> int temp ;<br /> Stack * current = top;<br /> temp = current -> info ;<br /> top = top -> previous ;<br /> delete current ;<br /> return temp ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> int StackTop ()<br /> {<br /> return top -> info ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> Boolean isEmpty()<br /> {<br /> if ( top == NULL )<br /> return True;<br /> else<br /> return False ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> Boolean isOperand ( char ch )<br /> {<br /> if ( ch >= '0' &#038;& ch <= '9' ) //if is a number<br /> return True;<br /> else<br /> return False ;<br /> }<br /> <br /> // <hr class="bbcode_rule" /> void Infix ( char infix[][10])<br /> {<br /> char c ;<br /> while ( c != 13 )<br /> {<br /> c = getch() ;<br /> putch(c);<br /> if ( c >= '0' &#038;& c <= '9' )<br /> {<br /> infix [cnt][cntcol] = c  ;<br /> cntcol++ ;<br /> }<br /> else if ( c == '+'|| c == '-'|| c == '*'|| c == '/')<br /> {<br /> infix [cnt][cntcol] = '' ;<br /> cnt++ ;<br /> infix [cnt][0] = c ;<br /> infix [cnt][1] = '' ;<br /> cnt++ ;<br /> cntcol = 0 ;<br /> }<br /> else if ( c == 13 )<br /> infix[cnt][cntcol] = '' ;<br /> }<br /> }<br /> <br /> <br /> // <hr class="bbcode_rule" /> int Calculate (int op1, char opr, int op2)<br /> {<br /> int ans ;<br /> switch ( opr )<br /> {<br /> case '+' :  ans = op1 + op2 ; break ;<br /> case '-' :  ans = op1 - op2 ; break ;<br /> case '*' :  ans = op1 * op2 ; break ;<br /> case '/' :  ans = op1 / op2 ; break ;<br /> case '^' :  ans = pow(op1, op2) ;<br /> }<br /> return ans ;<br /> }<br /> // <hr class="bbcode_rule" /> int Evaluate ( char postfix[][10] )<br /> {<br /> for ( int i = 0 ; i <= cnt ; i ++ )<br /> {<br /> char ch = postfix<i>[0] ;<br /> char ch1[10] ;<br /> strcpy ( ch1 ,postfix </i><i> ) ;<br /> //  cout <<endl<< atoi ( ch1) ;<br /> if ( isOperand ( ch ) == True )<br /> Push ( atoi(ch1)  );<br /> else<br /> {<br /> int op2 = Pop () ;<br /> int op1 = Pop () ;<br /> int ans = Calculate ( op1, ch, op2 ) ;<br /> //     cout << ans << endl ;<br /> Push ( ans ) ;<br /> }<br /> }<br /> int ans = Pop () ;<br /> return ans ;<br /> }<br /> <br /> // </i> <hr class="bbcode_rule" /> int CheckP (char cur, char st)<br /> {<br /> int a = NOTGREATER ;<br /> <br /> if ( cur == '(' )<br /> a = GREATER ;<br /> else if ( cur != '(' &#038;& st == '(' )<br /> a = GREATER ;<br /> else if ( cur != '(' &#038;& st != '(' )<br /> {<br /> if ( ( cur == '*' || cur == '/' ) &#038;& ( st == '+' || st == '-' ) )<br /> a = GREATER ;<br /> }<br /> return a ;<br /> <br /> }<br /> <br /> <br /> // <hr class="bbcode_rule" /> void infixToPostfix ( char infix[][10], char postfix[][10] )<br /> {<br /> int postcol = 0 ;<br /> for ( int i = 0 ; i <= cnt ; i ++ )<br /> {<br /> // strcpy(postfix<i>, infix </i><i>) ;<br /> // cout << postfix</i><i> ;<br /> char ch;<br /> ch = infix</i><i>[0]  ;<br /> if ( isOperand ( ch ) == True )<br /> strcpy ( postfix [postcnt++] , infix </i><i> ) ;<br /> else<br /> {<br /> if ( isEmpty() == True )<br /> Push ( int(ch) ) ;<br /> else<br /> {<br /> while ( CheckP( ch, StackTop() ) != GREATER &#038;& isEmpty() != True )<br /> {<br /> char c ;<br /> if ( ch == ')' )<br /> {<br /> do<br /> {<br /> c = char ( Pop() ) ;<br /> if ( c != '(')<br /> {<br /> postfix [postcnt][postcol] = c ;<br /> postfix [postcnt][postcol+1] = '' ;<br /> postcnt++ ;<br /> }<br /> }while ( c != '(' &#038;& isEmpty() != True);<br /> break ;<br /> }<br /> else<br /> c = char ( Pop() ) ;<br /> if ( c != '(' &#038;& c != ')' )<br /> {<br /> postfix [postcnt][postcol] = c ;<br /> postfix [postcnt][postcol+1] = '' ;<br /> postcnt++ ;<br /> }<br /> }<br /> if ( ch != ')' )<br /> Push ( int(ch) ) ;<br /> }<br /> }<br /> }<br /> <br /> while ( isEmpty () != True )<br /> {<br /> char c = char ( Pop () ) ;<br /> postfix [postcnt][postcol] = c ;<br /> postfix [postcnt][postcol+1] = '';<br /> postcnt++ ;<br /> }<br /> //   postfix[postcnt][postcol]  = '';<br /> }<br /> <br /> //</i> <hr class="bbcode_rule" /> void Postfix ( char postfix[][10] )<br /> {<br /> char ch[10] ;<br /> for ( int i = 0; i <= postcnt; i++ )<br /> {<br /> strcpy(ch , postfix<i> ) ;<br /> printf ( "%c" ,ch );<br /> }<br /> }<br /> <br /> // </i> <hr class="bbcode_rule" /> void main()<br /> {<br /> //clrscr();<br /> top = NULL ;<br /> <br /> char infix [ 50 ][ 10 ] ;<br /> char postfix [ 50 ][ 10 ] ;<br /> <br /> //gotoxy ( 5, 8 ) ;<br /> printf ( "Enter Arithematic Expression ...................... : " );<br /> Infix ( infix ) ;<br /> <br /> infixToPostfix ( infix, postfix ) ;<br /> //gotoxy ( 5, 10 ) ;<br /> printf ( "Arithematic Expression in Postfix Notation......... : " );<br /> Postfix ( postfix ) ;<br /> int ans = Evaluate ( postfix ) ;<br /> //gotoxy (5, 11 ) ;<br /> printf (  "The Answer of Expression .......................... : " );<br /> printf ( "%i", ans );<br /> <br /> getch();<br /> }<br /> // <hr class="bbcode_rule" />

[GWILouisaxwzkla]

Heres a linked list program I had laying around:

<br /> /****************************************************************<br /> * File Name : cgt.cpp<br /> * Date : April,10,2007<br /> * Comments : new project<br /> * Compiler/Assembler : VC++ 6.0<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 2:59:58<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> struct node<br /> {<br /> <br /> int data;<br /> node * next;<br /> node * back;<br /> <br /> };<br /> <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> void readList ( node ** list );<br /> bool listsAreEqual ( node * left , node * right );<br /> node * copyList ( node * list );<br /> void printList ( node * list );<br /> void destroyList ( node ** list );<br /> bool listsContainEqualMembers ( node * left , node * right );<br /> <br /> //##################################################################################<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> node * head1 = 0;<br /> node * head2 = 0;<br /> <br /> cout &lt;&lt; &quot;enter first list :&quot; &lt;&lt; endl;<br /> readList ( &amp; head1 );<br /> cout &lt;&lt; &quot;enter second list: &quot; &lt;&lt; endl;<br /> readList ( &amp; head2 );<br /> <br /> if ( listsAreEqual ( head1 , head2 ) )<br /> cout &lt;&lt; endl &lt;&lt; &quot;The lists are equal&quot; &lt;&lt; endl;<br /> else<br /> cout &lt;&lt; endl &lt;&lt; &quot;The lists are not equal&quot; &lt;&lt; endl;<br /> <br /> cout &lt;&lt; endl;<br /> if ( listsContainEqualMembers ( head1 , head2 ) )<br /> cout &lt;&lt; endl &lt;&lt; &quot;lists contain equal members&quot; &lt;&lt; endl;<br /> else<br /> cout &lt;&lt; endl &lt;&lt; &quot;lists do not contain equal members &quot; &lt;&lt; endl;<br /> <br /> <br /> node * copy = copyList ( head1 );<br /> cout &lt;&lt; endl &lt;&lt; &quot;copy of first list is: &quot;;<br /> printList ( copy );<br /> destroyList ( &amp; head1 );<br /> destroyList ( &amp; head2 );<br /> destroyList ( &amp; copy );<br /> return 0 ;<br /> }<br /> <br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : readList<br /> Parameters :<br /> <br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void readList ( node ** list )<br /> {<br /> <br /> cout &lt;&lt; &quot;enter an integer ( -1 to stop ) &quot;;<br /> int i;<br /> cin &gt;&gt; i;<br /> node * temp = 0;<br /> <br /> while ( i != -1 )<br /> {<br /> <br /> temp = new node;<br /> if ( temp == 0 )<br /> {<br /> cout &lt;&lt; &quot; allocation error&quot; ;<br /> ( * list ) = 0;<br /> return;<br /> }<br /> temp -&gt; data = i ;<br /> if ( ( * list ) == 0 )<br /> {<br /> ( * list ) = temp;<br /> temp -&gt; next = 0;<br /> temp -&gt; back = temp;<br /> <br /> }<br /> else<br /> {<br /> ( * list ) -&gt; back -&gt; next = temp;<br /> temp -&gt; next = temp -&gt; back = 0;<br /> ( * list ) -&gt; back = temp;<br /> }<br /> cout &lt;&lt; &quot;enter a number ( -1 to stop ) &quot;;<br /> cin &gt;&gt; i;<br /> }<br /> <br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : listsAreEqual<br /> Parameters :<br /> <br /> <br /> <br /> Returns: user defined type , bool<br /> <br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool listsAreEqual ( node * left , node * right )<br /> {<br /> <br /> bool matches = true;<br /> <br /> while ( left != 0 &amp;&amp; right != 0 &amp;&amp; matches )<br /> {<br /> <br /> if ( left -&gt; data != right -&gt; data )<br /> matches = false;<br /> else<br /> {<br /> left = left -&gt; next;<br /> right = right -&gt; next;<br /> }<br /> }<br /> if ( ! left &amp;&amp; ! right &amp;&amp; matches )<br /> return true;<br /> <br /> return false;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : copyList<br /> Parameters :<br /> <br /> <br /> <br /> Returns: user defined type , node *<br /> <br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> node * copyList ( node * list )<br /> {<br /> <br /> node * temp = 0;<br /> node * newList = 0;<br /> <br /> while ( list )<br /> {<br /> <br /> temp = new node;<br /> if ( ! temp )<br /> {<br /> cout &lt;&lt; &quot;allocation error! &quot;;<br /> return 0;<br /> }<br /> if ( newList == 0 )<br /> {<br /> newList = temp;<br /> temp -&gt; data = list -&gt; data;<br /> newList -&gt; next = 0;<br /> newList -&gt; back = temp;<br /> }<br /> else<br /> {<br /> temp -&gt; data = list -&gt; data;<br /> newList -&gt; back -&gt; next = temp;<br /> newList -&gt; back = temp;<br /> temp -&gt; next = temp -&gt; next = 0;<br /> }<br /> list = list -&gt; next;<br /> }<br /> return newList;<br /> }<br /> void printList ( node * temp )<br /> {<br /> <br /> <br /> cout &lt;&lt; &quot;list read is &quot; ;<br /> while ( temp )<br /> {<br /> cout &lt; data &lt;&lt; &quot; &quot;;<br /> temp = temp -&gt; next;<br /> }<br /> cout &lt;&lt; endl;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : destroyList<br /> Parameters :<br /> <br /> <br /> <br /> Returns: user defined type , void<br /> <br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void destroyList ( node ** list )<br /> {<br /> <br /> <br /> node * temp = ( * list );<br /> node * temp2 = 0;<br /> while ( temp )<br /> {<br /> <br /> temp2 = temp;<br /> temp = temp -&gt; next;<br /> delete temp2;<br /> }<br /> <br /> ( * list ) = 0;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : listsContainEqualMembers<br /> Parameters :<br /> <br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool listsContainEqualMembers ( node * left , node * right )<br /> {<br /> <br /> <br /> node * temp1 = left;<br /> node * temp2 = right;<br /> bool matches ;<br /> int length1 = 0 , length2 = 0;<br /> int numItems1 = 0 , numItems2 = 0;<br /> <br /> while ( temp1 &amp;&amp; matches )<br /> {<br /> temp2 = right;<br /> matches = false;<br /> length1 ++; //get length of first list<br /> while ( temp2 &amp;&amp; ! matches )<br /> {<br /> if ( temp1 -&gt; data == temp2 -&gt; data )<br /> matches = true;<br /> if ( ! matches )<br /> temp2 = temp2 -&gt; next;<br /> }<br /> if ( matches )<br /> temp1 = temp1 -&gt; next;<br /> }<br /> temp2 = right;<br /> while ( temp2 )<br /> {<br /> length2 ++ ;<br /> temp2 = temp2 -&gt; next;<br /> }<br /> if ( length1 == length2 &amp;&amp; matches )<br /> return true;<br /> return false;<br /> }<br /> <br />

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 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303

<br /> /****************************************************************<br /> * File Name : cgt.cpp<br /> * Date : April,10,2007<br /> * Comments : new project<br /> * Compiler/Assembler : VC++ 6.0<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 2:59:58<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> struct node<br /> {<br /> <br /> int data;<br /> node * next;<br /> node * back;<br /> <br /> };<br /> <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> void readList ( node ** list );<br /> bool listsAreEqual ( node * left , node * right );<br /> node * copyList ( node * list );<br /> void printList ( node * list );<br /> void destroyList ( node **  list );<br /> bool listsContainEqualMembers ( node * left , node * right );<br /> <br /> //##################################################################################<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> node * head1 = 0;<br /> node * head2 = 0;<br /> <br /> cout &lt;&lt; &quot;enter first list :&quot; &lt;&lt; endl;<br /> readList ( &amp; head1 );<br /> cout &lt;&lt; &quot;enter second list: &quot; &lt;&lt; endl;<br /> readList ( &amp; head2 );<br /> <br /> if ( listsAreEqual ( head1 , head2 ) )<br /> cout &lt;&lt; endl &lt;&lt; &quot;The lists are equal&quot; &lt;&lt; endl;<br /> else<br /> cout &lt;&lt; endl &lt;&lt; &quot;The lists are not equal&quot; &lt;&lt; endl;<br /> <br /> cout &lt;&lt; endl;<br /> if ( listsContainEqualMembers ( head1 , head2 ) )<br /> cout &lt;&lt; endl &lt;&lt; &quot;lists contain equal members&quot; &lt;&lt; endl;<br /> else<br /> cout &lt;&lt; endl &lt;&lt; &quot;lists do not contain equal members &quot; &lt;&lt; endl;<br /> <br /> <br /> node * copy = copyList ( head1 );<br /> cout &lt;&lt; endl &lt;&lt; &quot;copy of first list is: &quot;;<br /> printList ( copy );<br /> destroyList ( &amp; head1 );<br /> destroyList ( &amp; head2 );<br /> destroyList ( &amp; copy );<br /> return 0 ;<br /> }<br /> <br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : readList<br /> Parameters :<br /> <br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void readList ( node ** list )<br /> {<br /> <br /> cout &lt;&lt; &quot;enter an integer ( -1 to stop ) &quot;;<br /> int i;<br /> cin &gt;&gt; i;<br /> node * temp = 0;<br /> <br /> while (  i != -1 )<br /> {<br /> <br /> temp = new node;<br /> if ( temp == 0 )<br /> {<br /> cout &lt;&lt; &quot; allocation error&quot; ;<br /> ( * list ) = 0;<br /> return;<br /> }<br /> temp -&gt; data = i ;<br /> if ( ( * list ) == 0 )<br /> {<br /> ( * list ) = temp;<br /> temp -&gt; next = 0;<br /> temp -&gt; back = temp;<br /> <br /> }<br /> else<br /> {<br /> ( * list ) -&gt; back -&gt; next = temp;<br /> temp -&gt; next = temp -&gt; back = 0;<br /> ( * list ) -&gt; back = temp;<br /> }<br /> cout &lt;&lt; &quot;enter a number ( -1 to stop ) &quot;;<br /> cin &gt;&gt; i;<br /> }<br /> <br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : listsAreEqual<br /> Parameters :<br /> <br /> <br /> <br /> Returns: user defined type , bool<br /> <br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool listsAreEqual ( node * left , node * right )<br /> {<br /> <br /> bool matches = true;<br /> <br /> while ( left != 0  &amp;&amp; right != 0 &amp;&amp; matches )<br /> {<br /> <br /> if ( left -&gt; data != right -&gt; data )<br /> matches = false;<br /> else<br /> {<br /> left = left -&gt; next;<br /> right = right -&gt; next;<br /> }<br /> }<br /> if ( ! left &amp;&amp; ! right &amp;&amp; matches )<br /> return true;<br /> <br /> return false;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : copyList<br /> Parameters :<br /> <br /> <br /> <br /> Returns: user defined type , node *<br /> <br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> node * copyList ( node * list )<br /> {<br /> <br /> node * temp = 0;<br /> node * newList = 0;<br /> <br /> while ( list )<br /> {<br /> <br /> temp = new node;<br /> if ( ! temp )<br /> {<br /> cout &lt;&lt; &quot;allocation error! &quot;;<br /> return 0;<br /> }<br /> if ( newList == 0 )<br /> {<br /> newList = temp;<br /> temp -&gt; data = list -&gt; data;<br /> newList -&gt; next = 0;<br /> newList -&gt; back = temp;<br /> }<br /> else<br /> {<br /> temp -&gt; data = list -&gt; data;<br /> newList -&gt; back -&gt; next = temp;<br /> newList -&gt; back = temp;<br /> temp -&gt; next = temp -&gt; next = 0;<br /> }<br /> list = list -&gt; next;<br /> }<br /> return newList;<br /> }<br /> void printList ( node * temp )<br /> {<br /> <br /> <br /> cout &lt;&lt; &quot;list read is &quot; ;<br /> while ( temp )<br /> {<br /> cout &lt; data &lt;&lt; &quot; &quot;;<br /> temp = temp -&gt; next;<br /> }<br /> cout &lt;&lt; endl;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : destroyList<br /> Parameters :<br /> <br /> <br /> <br /> Returns: user defined type , void<br /> <br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void destroyList ( node ** list )<br /> {<br /> <br /> <br /> node * temp = ( * list );<br /> node * temp2 = 0;<br /> while ( temp )<br /> {<br /> <br /> temp2 = temp;<br /> temp = temp -&gt; next;<br /> delete temp2;<br /> }<br /> <br /> ( * list ) = 0;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : listsContainEqualMembers<br /> Parameters :<br /> <br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool listsContainEqualMembers ( node * left , node * right )<br /> {<br /> <br /> <br /> node * temp1 = left;<br /> node * temp2 = right;<br /> bool matches ;<br /> int length1 = 0 , length2 = 0;<br /> int numItems1 = 0 , numItems2 = 0;<br /> <br /> while ( temp1 &amp;&amp; matches )<br /> {<br /> temp2 = right;<br /> matches = false;<br /> length1 ++; //get length of first list<br /> while ( temp2 &amp;&amp; ! matches )<br /> {<br /> if ( temp1 -&gt; data == temp2 -&gt; data )<br /> matches = true;<br /> if ( ! matches )<br /> temp2 = temp2 -&gt; next;<br /> }<br /> if ( matches )<br /> temp1 = temp1 -&gt; next;<br /> }<br /> temp2 = right;<br /> while ( temp2 )<br /> {<br /> length2 ++ ;<br /> temp2 = temp2 -&gt; next;<br /> }<br /> if ( length1 == length2 &amp;&amp; matches )<br /> return true;<br /> return false;<br /> }<br /> <br />

heres another one:

<br /> <br /> <br /> #include <br /> #include <br /> //simple list<br /> <br /> typedef struct nodeType<br /> {<br /> int i;<br /> struct nodeType * next;<br /> } node;<br /> <br /> void print ( node * );<br /> void addBack ( int , node ** , node ** );<br /> void addFront ( int , node ** , node ** );<br /> void destroy ( node ** );<br /> <br /> void main()<br /> {<br /> <br /> node * head = NULL;<br /> node * tail = NULL;<br /> char choice;<br /> char newline;<br /> int i;<br /> do<br /> {<br /> printf ( "choose an operation: n" );<br /> printf ( "1. add a node to back of list n" );<br /> printf ( "2. add a node to front of list n" );<br /> printf ( "3. print the list. n" );<br /> printf ( "4. exit n" );<br /> choice = getchar ();<br /> newline = getchar ();<br /> printf ( "n" );<br /> switch ( choice )<br /> {<br /> case '1':<br /> {<br /> printf ( "enter an integer : n" );<br /> scanf ( "%d",&amp; i );<br /> addBack ( i , &amp; head , &amp; tail );<br /> newline = getchar ();<br /> };<br /> break;<br /> case '2':<br /> {<br /> printf ( "enter an integer : n" );<br /> scanf ( "%d",&amp; i );<br /> addFront ( i , &amp; head , &amp; tail );<br /> newline = getchar ();<br /> };<br /> break;<br /> case '3':<br /> {<br /> print ( head );<br /> };<br /> break;<br /> case '4':<br /> {<br /> printf ( "goodbye! n" );<br /> };<br /> break;<br /> default: printf ( "bad choice ! n" );<br /> <br /> };<br /> printf ( "n" );<br /> }<br /> while ( choice != '4' );<br /> destroy ( &amp; head );<br /> <br /> <br /> <br /> <br /> <br /> }<br /> <br /> void print ( node * r )<br /> {<br /> <br /> node * t = r;<br /> <br /> printf ( "This is the list: n" );<br /> <br /> while ( t != NULL )<br /> {<br /> printf ( "%c" ," " );<br /> printf ( "%i" , t -&gt; i );<br /> printf ( "%c" , " " );<br /> t = t -&gt; next;<br /> }<br /> printf ( "n" );<br /> <br /> }<br /> <br /> void addBack ( int n , node ** h , node ** t )<br /> {<br /> <br /> if ( ( * h ) == NULL )<br /> {<br /> ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br /> ( * t ) -&gt; i = n;<br /> ( * t ) -&gt; next = NULL;<br /> <br /> }<br /> else<br /> {<br /> <br /> ( * t ) -&gt; next = malloc ( sizeof ( node ) );<br /> ( * t ) -&gt; next -&gt; i = n;<br /> ( * t ) -&gt; next -&gt; next = NULL;<br /> ( * t ) = ( * t ) -&gt; next;<br /> <br /> }<br /> }<br /> <br /> void addFront ( int n , node ** h , node ** t )<br /> {<br /> <br /> if ( ( * h ) == NULL ) //empty list<br /> {<br /> <br /> ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br /> ( * t ) -&gt; i = n;<br /> ( * t ) -&gt; next = NULL;<br /> <br /> }<br /> else //add to front<br /> {<br /> node * temp = ( * h );<br /> <br /> ( * h ) = malloc ( sizeof ( node ) );<br /> ( * h ) -&gt; i = n;<br /> ( * h ) -&gt; next = temp;<br /> }<br /> }<br /> <br /> void destroy ( node ** h )<br /> {<br /> <br /> node * temp;<br /> <br /> while ( ( * h ) != NULL )<br /> {<br /> temp = ( * h );<br /> ( * h ) = ( * h ) -&gt; next;<br /> free ( temp );<br /> }<br /> }<br /> <br /> <br />

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

<br /> <br /> <br /> #include <br /> #include <br /> //simple list<br /> <br /> typedef struct nodeType<br /> {<br /> int i;<br /> struct nodeType * next;<br /> } node;<br /> <br /> void print ( node * );<br /> void addBack ( int , node **  , node ** );<br /> void addFront ( int , node ** , node ** );<br /> void destroy ( node ** );<br /> <br /> void main()<br /> {<br /> <br /> node * head = NULL;<br /> node * tail = NULL;<br /> char choice;<br /> char newline;<br /> int i;<br /> do<br /> {<br /> printf ( "choose an operation: n" );<br /> printf ( "1. add a node to back of list n" );<br /> printf ( "2. add a node to front of list n" );<br /> printf ( "3. print the list. n" );<br /> printf ( "4. exit n" );<br /> choice = getchar ();<br /> newline = getchar ();<br /> printf ( "n" );<br /> switch ( choice )<br /> {<br /> case '1':<br /> {<br /> printf ( "enter an integer : n" );<br /> scanf ( "%d",&amp; i );<br /> addBack ( i , &amp; head , &amp; tail );<br /> newline = getchar ();<br /> };<br /> break;<br /> case '2':<br /> {<br /> printf ( "enter an integer : n" );<br /> scanf ( "%d",&amp; i );<br /> addFront ( i , &amp; head , &amp; tail );<br /> newline = getchar ();<br /> };<br /> break;<br /> case '3':<br /> {<br /> print ( head );<br /> };<br /> break;<br /> case '4':<br /> {<br /> printf ( "goodbye! n" );<br /> };<br /> break;<br /> default: printf ( "bad choice ! n" );<br /> <br /> };<br /> printf ( "n" );<br /> }<br /> while ( choice != '4' );<br /> destroy ( &amp; head );<br /> <br /> <br /> <br /> <br /> <br /> }<br /> <br /> void print ( node * r )<br /> {<br /> <br /> node * t = r;<br /> <br /> printf ( "This is the list: n" );<br /> <br /> while ( t != NULL )<br /> {<br /> printf ( "%c" ," " );<br /> printf ( "%i" , t -&gt; i );<br /> printf ( "%c" , " " );<br /> t = t -&gt; next;<br /> }<br /> printf ( "n" );<br /> <br /> }<br /> <br /> void addBack ( int n , node ** h  , node ** t )<br /> {<br /> <br /> if ( ( * h  ) == NULL )<br /> {<br /> ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br /> ( * t ) -&gt; i = n;<br /> ( * t ) -&gt; next = NULL;<br /> <br /> }<br /> else<br /> {<br /> <br /> ( * t ) -&gt; next = malloc ( sizeof ( node ) );<br /> ( * t ) -&gt; next -&gt; i = n;<br /> ( * t ) -&gt; next -&gt; next = NULL;<br /> ( * t ) = ( * t ) -&gt; next;<br /> <br /> }<br /> }<br /> <br /> void addFront ( int n , node ** h , node ** t )<br /> {<br /> <br /> if ( ( * h ) == NULL ) //empty list<br /> {<br /> <br /> ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br /> ( * t ) -&gt; i = n;<br /> ( * t ) -&gt; next = NULL;<br /> <br /> }<br /> else //add to front<br /> {<br /> node * temp = ( * h );<br /> <br /> ( * h ) = malloc ( sizeof ( node ) );<br /> ( * h ) -&gt; i = n;<br /> ( * h ) -&gt; next = temp;<br /> }<br /> }<br /> <br /> void destroy ( node ** h )<br /> {<br /> <br /> node * temp;<br /> <br /> while ( ( * h ) != NULL )<br /> {<br /> temp = ( * h );<br /> ( * h ) = ( * h ) -&gt; next;<br /> free ( temp );<br /> }<br /> }<br /> <br /> <br />

[GWILouisaxwzkla]

could try:

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : August,11,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 2:00:25 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> int numberYears;<br /> float interestRate;<br /> int initialAmount;<br /> <br /> cout &lt;&lt; &quot;enter intial amount: &quot;;<br /> cin &gt;&gt; initialAmount;<br /> <br /> cout &lt;&lt; &quot;enter the interest rate: ( rate % ) &quot; ;<br /> cin &gt;&gt; interestRate;<br /> interestRate = interestRate / 100;<br /> cin.get ();<br /> <br /> cout &lt;&lt; &quot;enter number of years: &quot;;<br /> cin &gt;&gt; numberYears;<br /> <br /> cout &lt;&lt; &quot;amount plus interest: &quot;;<br /> cout &lt;&lt; initialAmount + ( ( interestRate * initialAmount ) * numberYears ) ;<br /> cout &lt;&lt; endl;<br /> <br /> <br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> <br /> <br />

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

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : August,11,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 2:00:25 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> int numberYears;<br /> float interestRate;<br /> int initialAmount;<br /> <br /> cout &lt;&lt; &quot;enter intial amount: &quot;;<br /> cin &gt;&gt; initialAmount;<br /> <br /> cout &lt;&lt; &quot;enter the interest rate: ( rate % ) &quot; ;<br /> cin &gt;&gt; interestRate;<br /> interestRate = interestRate / 100;<br /> cin.get ();<br /> <br /> cout &lt;&lt; &quot;enter number of years: &quot;;<br /> cin &gt;&gt; numberYears;<br /> <br /> cout &lt;&lt; &quot;amount plus interest: &quot;;<br /> cout &lt;&lt; initialAmount + ( ( interestRate * initialAmount ) * numberYears ) ;<br /> cout &lt;&lt; endl;<br /> <br /> <br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> <br /> <br />

output:

<br /> enter intial amount: 100<br /> enter the interest rate: ( rate % ) 10%<br /> enter number of years: 2<br /> amount plus interest: 120<br /> Press any key to continue<br /> <br />

1 2 3 4 5 6 7 8

<br /> enter intial amount: 100<br /> enter the interest rate: ( rate % ) 10%<br /> enter number of years: 2<br /> amount plus interest: 120<br /> Press any key to continue<br /> <br />

[GWILouisaxwzkla]

This seems to work:

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : August,10,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 3:17:50 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> //CHANGE FILE NAMES TO WHAT YOU WANT HERE !!!!!!!!!!!!!!!!!!!!!<br /> <br /> FILE * inputFile = fopen ( "c:\programs\data.txt", "r+" );<br /> <br /> FILE * outputFile1 = fopen ( "c:\programs\data2.txt", "w+" );<br /> FILE * outputFile2 = fopen ( "c:\programs\data3.txt", "w+" );<br /> FILE * outputFile3 = fopen ( "c:\programs\data4.txt", "w+" );<br /> FILE * outputFile4 = fopen ( "c:\programs\data5.txt", "w+" );<br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> char ch;<br /> char newline = 10;<br /> <br /> ch = fgetc ( inputFile );<br /> fgetc ( inputFile );<br /> while ( ! feof ( inputFile ) )<br /> {<br /> <br /> if ( ch == 'A' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile1 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile1);<br /> }<br /> if ( ch == 'B' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile2 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile2 );<br /> }<br /> if ( ch == 'C' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile3 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile3);<br /> }<br /> if ( ch == 'D' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile4 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile4);<br /> }<br /> <br /> ch = fgetc ( inputFile );<br /> fgetc ( inputFile );<br /> }<br /> fclose ( outputFile1 );<br /> fclose ( outputFile2 );<br /> fclose ( outputFile3 );<br /> fclose ( outputFile4 );<br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> <br /> <br />

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

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : August,10,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 3:17:50 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> //CHANGE FILE NAMES TO WHAT YOU WANT HERE !!!!!!!!!!!!!!!!!!!!!<br /> <br /> FILE * inputFile  = fopen ( "c:\programs\data.txt", "r+" );<br /> <br /> FILE * outputFile1 = fopen ( "c:\programs\data2.txt", "w+" );<br /> FILE * outputFile2 = fopen ( "c:\programs\data3.txt", "w+" );<br /> FILE * outputFile3 = fopen ( "c:\programs\data4.txt", "w+" );<br /> FILE * outputFile4 = fopen ( "c:\programs\data5.txt", "w+" );<br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> char ch;<br /> char newline = 10;<br /> <br /> ch = fgetc ( inputFile );<br /> fgetc ( inputFile );<br /> while ( ! feof ( inputFile )  )<br /> {<br /> <br /> if ( ch == 'A' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile1 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile1);<br /> }<br /> if ( ch == 'B' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile2 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile2 );<br /> }<br /> if ( ch == 'C' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile3 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile3);<br /> }<br /> if ( ch == 'D' )<br /> {<br /> ch = fgetc ( inputFile );<br /> while ( ch != newline )<br /> {<br /> fputc ( ch , outputFile4 );<br /> ch = fgetc ( inputFile );<br /> }<br /> fputc ( 'n' , outputFile4);<br /> }<br /> <br /> ch = fgetc ( inputFile );<br /> fgetc ( inputFile );<br /> }<br /> fclose ( outputFile1 );<br /> fclose ( outputFile2 );<br /> fclose ( outputFile3 );<br /> fclose ( outputFile4 );<br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> <br /> <br />

[GWILouisaxwzkla]

could try this:

<br /> #include <br /> <br /> void main()<br /> {<br /> <br /> int i;<br /> cout &lt;&lt; &quot;Enter a number to convert &quot;;<br /> cin &gt;&gt; i;<br /> int binaryArray [ 20 ] ; //whatever<br /> int j = 0;<br /> while ( i )<br /> {<br /> binaryArray [ j ++ ] = i % 2 ;<br /> i /= 2;<br /> }<br /> <br /> cout &lt;&lt; endl &lt;&lt; &quot;Binary Version: &quot; ;<br /> while ( j -- &gt; 0 )<br /> cout &lt;&lt; binaryArray [ j ];<br /> cout &lt;&lt; endl;<br /> }<br />

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

<br /> #include <br /> <br /> void main()<br /> {<br /> <br /> int i;<br /> cout &lt;&lt; &quot;Enter a number to convert &quot;;<br /> cin &gt;&gt; i;<br /> int binaryArray [ 20 ] ; //whatever<br /> int j = 0;<br /> while ( i )<br /> {<br /> binaryArray [ j ++ ] = i % 2 ;<br /> i /= 2;<br /> }<br /> <br /> cout &lt;&lt; endl &lt;&lt; &quot;Binary Version: &quot; ;<br /> while ( j -- &gt; 0 )<br /> cout &lt;&lt; binaryArray [ j  ];<br /> cout &lt;&lt; endl;<br /> }<br />

[GWILouisaxwzkla]

What type of sort are you using ? I would just sort , count unique instances , allocate enough memory to hold the unique instances and copy the data ……

[GWILouisaxwzkla]

A little correction. It seems you are passing arrays of names , id’s and crn into the function:

<br /> void addStudent (char name[SIZE][LENGTH], int id[SIZE], int crn[SIZE][4]);<br />

1 2 3

<br /> void addStudent (char name[SIZE][LENGTH], int id[SIZE], int crn[SIZE][4]);<br />

so you would change your prototype to :

<br /> const int numberOfStudents = 20; //whatever<br /> void addStudent ( STUDENT newStudent [ numberOfStudents ] );<br />

1 2 3 4

<br /> const int numberOfStudents = 20; //whatever<br /> void addStudent ( STUDENT newStudent [ numberOfStudents ] );<br />

and access the data members like this:

<br /> ..........<br /> int i = currentStudent;<br /> printf ( newStudent [ currentStudent ].name ); //output the student name<br /> printf ( "%i" , newStudent [ currentStudent ] .id ); //output the student id<br /> <br />

1 2 3 4 5 6 7

<br /> ..........<br /> int i = currentStudent;<br /> printf ( newStudent [ currentStudent ].name ); //output the student name<br /> printf ( "%i" , newStudent [ currentStudent ] .id ); //output the student id<br /> <br />

my bad ………

[GWILouisaxwzkla]

You really just need to group all your data together ( structs are handy for this purpose ). So if you have a function prototype like:

<br /> void addStudent (char name[SIZE][LENGTH], int id[SIZE], int crn[SIZE][4]);<br />

1 2 3

<br /> void addStudent (char name[SIZE][LENGTH], int id[SIZE], int crn[SIZE][4]);<br />

change it to:

<br /> void addStudent ( STUDENT newStudent );<br />

1 2 3

<br /> void addStudent ( STUDENT newStudent );<br />

when you need to access a member of the struct , just use the dot operator and use the data as usual:

<br /> ..........<br /> printf ( newStudent.name ); //output the student name<br /> printf ( "%i" , newStudent.id ); //output the student id<br />

1 2 3 4 5

<br /> ..........<br /> printf ( newStudent.name ); //output the student name<br /> printf ( "%i" , newStudent.id ); //output the student id<br />

not too much to the conversion …….

[GWILouisaxwzkla]

Heres the basic program that creates a deck and draws a hand ( not sure what you need to do as far as identifing the type of hand ?? You need the program to tell if the hand falls in one of the catagories : ( high card, pair, three of a kind, full house, straight, flush, four of a kind, straight flush, and royal flush.” ) ?? . Anyway heres the code ( not very complicated just tedious to write ) :

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : July,27,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 12:13:49 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> #include <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> <br /> enum type { one , two , three , four , five , six , seven , eight , nine , ten , jack , queen , king };<br /> enum suite { clubs , diamonds , hearts , spades };<br /> <br /> <br /> struct card<br /> {<br /> <br /> type cardType;<br /> suite cardSuite;<br /> bool drawn;<br /> void initialize ( type thisCardType , suite thisCardSuite );<br /> };<br /> <br /> <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> void initializeDeck ( card * deck );<br /> int drawCard ( card * deck );<br /> void printHand ( card * hand );<br /> void createHand ( card * hand , card * deck );<br /> void rebuildDeck ( card * deck );<br /> <br /> //##################################################################################<br /> <br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> card deck [ 52 ];<br /> card hand [ 5 ];<br /> <br /> initializeDeck ( deck );<br /> createHand ( hand , deck );<br /> printHand ( hand );<br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : initialize<br /> Parameters :<br /> <br /> thisCardType a(n) type ( type ) ,<br /> thisCardSuite a(n) suite ( suite )<br /> <br /> <br /> Class/Struct associations : struct card<br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void card :: initialize ( type thisCardType , suite thisCardSuite )<br /> {<br /> <br /> cardType = thisCardType;<br /> cardSuite = thisCardSuite;<br /> drawn = false;<br /> return;<br /> }<br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : initializeDeck<br /> Parameters :<br /> <br /> deck a(n) cards * ( cards * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void initializeDeck ( card * deck )<br /> {<br /> <br /> deck [ 0 ].initialize ( one , clubs);<br /> deck [ 1 ].initialize ( two , clubs );<br /> deck [ 2 ].initialize ( three , clubs );<br /> deck [ 3 ].initialize ( four , clubs );<br /> deck [ 4 ].initialize ( five , clubs );<br /> deck [ 5 ].initialize ( six , clubs );<br /> deck [ 6 ].initialize ( seven , clubs);<br /> deck [ 7 ].initialize ( eight , clubs );<br /> deck [ 8 ].initialize ( nine , clubs);<br /> deck [ 9 ].initialize ( ten , clubs);<br /> deck [ 10 ].initialize ( jack , clubs );<br /> deck [ 11 ].initialize ( queen ,clubs );<br /> deck [ 12 ].initialize ( king , clubs );<br /> deck [ 13 ].initialize ( one , diamonds );<br /> deck [ 14 ].initialize ( two , diamonds );<br /> deck [ 15 ].initialize ( three , diamonds );<br /> deck [ 16 ].initialize ( four , diamonds );<br /> deck [ 17 ].initialize ( five , diamonds );<br /> deck [ 18 ].initialize ( six , diamonds );<br /> deck [ 19 ].initialize ( seven , diamonds );<br /> deck [ 20 ].initialize ( eight , diamonds );<br /> deck [ 21 ].initialize ( nine , diamonds );<br /> deck [ 22 ].initialize ( ten , diamonds );<br /> deck [ 23 ].initialize ( jack , diamonds );<br /> deck [ 24 ].initialize ( queen , diamonds );<br /> deck [ 25 ].initialize ( king , diamonds );<br /> deck [ 26 ].initialize ( one , hearts );<br /> deck [ 27 ].initialize ( two , hearts );<br /> deck [ 28 ].initialize ( three , hearts );<br /> deck [ 29 ].initialize ( four , hearts );<br /> deck [ 30 ].initialize ( five , hearts );<br /> deck [ 31 ].initialize ( six , hearts );<br /> deck [ 32 ].initialize ( seven , hearts );<br /> deck [ 33 ].initialize ( eight , hearts );<br /> deck [ 34 ].initialize ( nine , hearts );<br /> deck [ 35 ].initialize ( ten , hearts );<br /> deck [ 36 ].initialize ( jack , hearts );<br /> deck [ 37 ].initialize ( queen , hearts );<br /> deck [ 38 ].initialize ( king , hearts );<br /> deck [ 39 ].initialize ( one , spades );<br /> deck [ 40 ].initialize ( two , spades );<br /> deck [ 41 ].initialize ( three , spades );<br /> deck [ 42 ].initialize ( four , spades );<br /> deck [ 43 ].initialize ( five , spades );<br /> deck [ 44 ].initialize ( six , spades );<br /> deck [ 45 ].initialize ( seven , spades );<br /> deck [ 46 ].initialize ( eight ,spades );<br /> deck [ 47 ].initialize ( nine , spades );<br /> deck [ 48 ].initialize ( ten , spades );<br /> deck [ 49 ].initialize ( jack , spades );<br /> deck [ 50 ].initialize ( queen , spades );<br /> deck [ 51 ].initialize ( king , spades );<br /> <br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : drawCard<br /> Parameters :<br /> <br /> deck a(n) cards * ( cards * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> int drawCard ( card * deck )<br /> {<br /> srand ( time(NULL) );<br /> <br /> <br /> int i = rand () % 52;<br /> while ( deck [ i ].drawn == true )<br /> {<br /> <br /> i = rand () % 52;<br /> <br /> }<br /> deck [ i ].drawn = true;<br /> <br /> return i;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : printHand<br /> Parameters :<br /> <br /> hand a(n) cards * ( cards * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void printHand ( card * hand )<br /> {<br /> int i = 0;<br /> <br /> cout &lt;&lt; &quot;hand drawn :&quot; &lt;&lt; endl;<br /> <br /> while ( i &lt; 5 )<br /> {<br /> <br /> cout &lt;&lt; &quot; &quot;;<br /> switch ( hand [ i ].cardType )<br /> {<br /> case one:<br /> {<br /> cout &lt;&lt; &quot;one &quot;;<br /> };<br /> break;<br /> case two:<br /> {<br /> cout &lt;&lt; &quot;two &quot;;<br /> };<br /> break;<br /> case three:<br /> {<br /> cout &lt;&lt; &quot;three &quot;;<br /> };<br /> break;<br /> case four:<br /> {<br /> cout &lt;&lt; &quot;four &quot;;<br /> };<br /> break;<br /> case five:<br /> {<br /> cout &lt;&lt; &quot;five &quot;;<br /> };<br /> break;<br /> case six:<br /> {<br /> cout &lt;&lt; &quot;six &quot;;<br /> };<br /> break;<br /> case seven:<br /> {<br /> cout &lt;&lt; &quot;seven &quot;;<br /> };<br /> break;<br /> case eight:<br /> {<br /> cout &lt;&lt; &quot;eight &quot;;<br /> };<br /> break;<br /> case nine:<br /> {<br /> cout &lt;&lt; &quot;nine &quot;;<br /> };<br /> break;<br /> case ten:<br /> {<br /> cout &lt;&lt; &quot;ten &quot;;<br /> };<br /> break;<br /> case jack:<br /> {<br /> cout &lt;&lt; &quot;jack &quot;;<br /> };<br /> break;<br /> case queen:<br /> {<br /> cout &lt;&lt; &quot;queen &quot;;<br /> };<br /> break;<br /> case king:<br /> {<br /> cout &lt;&lt; &quot;king &quot;;<br /> };<br /> break;<br /> };<br /> cout &lt;&lt; &quot;of &quot;;<br /> switch ( hand [ i ].cardSuite )<br /> {<br /> case clubs:<br /> {<br /> cout &lt;&lt; &quot;clubs&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> case diamonds:<br /> {<br /> cout &lt;&lt; &quot;diamonds&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> case hearts:<br /> {<br /> cout &lt;&lt; &quot;hearts&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> case spades:<br /> {<br /> cout &lt;&lt; &quot;spades&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> };<br /> i ++;<br /> }<br /> <br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : createHand<br /> Parameters :<br /> <br /> hand a(n) card * ( card * ) ,<br /> deck a(n) card * ( card * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void createHand ( card * hand , card * deck )<br /> {<br /> <br /> int i = 0;<br /> int cardIndex;<br /> <br /> while ( i &lt; 5 )<br /> {<br /> cardIndex = drawCard ( deck );<br /> hand [ i ].cardType = deck [ cardIndex ].cardType;<br /> hand [ i ].cardSuite = deck [ cardIndex ].cardSuite;<br /> i ++;<br /> }<br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : rebuildDeck<br /> Parameters :<br /> <br /> deck a(n) card * ( card * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void rebuildDeck ( card * deck )<br /> {<br /> <br /> int i = 0;<br /> <br /> while ( i &lt; 52 )<br /> {<br /> deck [ i ].drawn = false;<br /> i ++;<br /> }<br /> <br /> <br /> return;<br /> }<br /> <br /> <br />

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 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378

<br /> /****************************************************************<br /> * File Name : c:programstempCG.cpp<br /> * Date : July,27,2009<br /> * Comments : new project<br /> * Compiler/Assembler : Visual C++ 6.0<br /> * Modifications :<br /> *<br /> *<br /> *<br /> *<br /> *<br /> * Program Shell Generated At: 12:13:49 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> <br /> #include <br /> #include <br /> #include <br /> //#include <br /> //#include <br /> //#include <br /> <br /> using namespace std;<br /> <br /> <br /> enum type { one , two , three , four , five , six , seven , eight , nine , ten , jack , queen , king };<br /> enum suite { clubs , diamonds , hearts , spades };<br /> <br /> <br /> struct card<br /> {<br /> <br /> type cardType;<br /> suite cardSuite;<br /> bool drawn;<br /> void initialize ( type thisCardType , suite thisCardSuite );<br /> };<br /> <br /> <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br /> <br /> void initializeDeck ( card * deck );<br /> int drawCard ( card * deck );<br /> void printHand ( card * hand );<br /> void createHand ( card * hand , card * deck );<br /> void rebuildDeck ( card * deck );<br /> <br /> //##################################################################################<br /> <br /> <br /> //main function ******************************<br /> <br /> int main ( )<br /> {<br /> <br /> card deck [ 52 ];<br /> card hand [ 5 ];<br /> <br /> initializeDeck ( deck );<br /> createHand ( hand , deck );<br /> printHand ( hand );<br /> <br /> return 0 ;<br /> }<br /> <br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : initialize<br /> Parameters :<br /> <br /> thisCardType a(n) type ( type )  ,<br /> thisCardSuite a(n) suite ( suite )<br /> <br /> <br /> Class/Struct associations : struct card<br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void card :: initialize ( type thisCardType , suite thisCardSuite )<br /> {<br /> <br /> cardType = thisCardType;<br /> cardSuite = thisCardSuite;<br /> drawn = false;<br /> return;<br /> }<br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : initializeDeck<br /> Parameters :<br /> <br /> deck a(n) cards * ( cards * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void initializeDeck ( card * deck )<br /> {<br /> <br /> deck [ 0 ].initialize ( one , clubs);<br /> deck [ 1 ].initialize ( two , clubs );<br /> deck [ 2 ].initialize ( three , clubs );<br /> deck [ 3 ].initialize ( four , clubs );<br /> deck [ 4 ].initialize ( five , clubs );<br /> deck [ 5 ].initialize ( six , clubs );<br /> deck [ 6 ].initialize ( seven , clubs);<br /> deck [ 7 ].initialize ( eight , clubs );<br /> deck [ 8 ].initialize ( nine , clubs);<br /> deck [ 9 ].initialize ( ten , clubs);<br /> deck [ 10 ].initialize ( jack , clubs );<br /> deck [ 11 ].initialize ( queen ,clubs  );<br /> deck [ 12 ].initialize ( king , clubs );<br /> deck [ 13 ].initialize ( one , diamonds );<br /> deck [ 14 ].initialize ( two , diamonds );<br /> deck [ 15 ].initialize ( three , diamonds );<br /> deck [ 16 ].initialize ( four , diamonds );<br /> deck [ 17 ].initialize ( five , diamonds );<br /> deck [ 18 ].initialize ( six , diamonds );<br /> deck [ 19 ].initialize ( seven , diamonds );<br /> deck [ 20 ].initialize ( eight , diamonds );<br /> deck [ 21 ].initialize ( nine , diamonds );<br /> deck [ 22 ].initialize ( ten , diamonds );<br /> deck [ 23 ].initialize ( jack , diamonds );<br /> deck [ 24 ].initialize ( queen , diamonds );<br /> deck [ 25 ].initialize ( king , diamonds );<br /> deck [ 26 ].initialize ( one , hearts );<br /> deck [ 27 ].initialize ( two , hearts );<br /> deck [ 28 ].initialize ( three , hearts );<br /> deck [ 29 ].initialize ( four , hearts );<br /> deck [ 30 ].initialize ( five , hearts );<br /> deck [ 31 ].initialize ( six , hearts );<br /> deck [ 32 ].initialize ( seven , hearts  );<br /> deck [ 33 ].initialize ( eight , hearts );<br /> deck [ 34 ].initialize ( nine , hearts );<br /> deck [ 35 ].initialize ( ten , hearts );<br /> deck [ 36 ].initialize ( jack , hearts );<br /> deck [ 37 ].initialize ( queen , hearts );<br /> deck [ 38 ].initialize ( king , hearts );<br /> deck [ 39 ].initialize ( one , spades );<br /> deck [ 40 ].initialize ( two , spades );<br /> deck [ 41 ].initialize ( three , spades );<br /> deck [ 42 ].initialize ( four , spades );<br /> deck [ 43 ].initialize ( five , spades );<br /> deck [ 44 ].initialize ( six , spades );<br /> deck [ 45 ].initialize ( seven , spades );<br /> deck [ 46 ].initialize ( eight ,spades  );<br /> deck [ 47 ].initialize ( nine , spades );<br /> deck [ 48 ].initialize ( ten , spades );<br /> deck [ 49 ].initialize ( jack , spades );<br /> deck [ 50 ].initialize ( queen , spades );<br /> deck [ 51 ].initialize ( king , spades );<br /> <br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : drawCard<br /> Parameters :<br /> <br /> deck a(n) cards * ( cards * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> int drawCard ( card * deck )<br /> {<br /> srand ( time(NULL) );<br /> <br /> <br /> int i = rand () % 52;<br /> while ( deck [ i ].drawn == true )<br /> {<br /> <br /> i = rand () % 52;<br /> <br /> }<br /> deck [ i ].drawn = true;<br /> <br /> return i;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : printHand<br /> Parameters :<br /> <br /> hand a(n) cards * ( cards * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void printHand ( card * hand )<br /> {<br /> int i = 0;<br /> <br /> cout &lt;&lt; &quot;hand drawn :&quot; &lt;&lt; endl;<br /> <br /> while ( i &lt; 5 )<br /> {<br /> <br /> cout &lt;&lt; &quot;  &quot;;<br /> switch ( hand [ i ].cardType )<br /> {<br /> case one:<br /> {<br /> cout &lt;&lt; &quot;one &quot;;<br /> };<br /> break;<br /> case two:<br /> {<br /> cout &lt;&lt; &quot;two &quot;;<br /> };<br /> break;<br /> case three:<br /> {<br /> cout &lt;&lt; &quot;three &quot;;<br /> };<br /> break;<br /> case four:<br /> {<br /> cout &lt;&lt; &quot;four &quot;;<br /> };<br /> break;<br /> case five:<br /> {<br /> cout &lt;&lt; &quot;five &quot;;<br /> };<br /> break;<br /> case six:<br /> {<br /> cout &lt;&lt; &quot;six &quot;;<br /> };<br /> break;<br /> case seven:<br /> {<br /> cout &lt;&lt; &quot;seven &quot;;<br /> };<br /> break;<br /> case eight:<br /> {<br /> cout &lt;&lt; &quot;eight &quot;;<br /> };<br /> break;<br /> case nine:<br /> {<br /> cout &lt;&lt; &quot;nine &quot;;<br /> };<br /> break;<br /> case ten:<br /> {<br /> cout &lt;&lt; &quot;ten &quot;;<br /> };<br /> break;<br /> case jack:<br /> {<br /> cout &lt;&lt; &quot;jack &quot;;<br /> };<br /> break;<br /> case queen:<br /> {<br /> cout &lt;&lt; &quot;queen &quot;;<br /> };<br /> break;<br /> case king:<br /> {<br /> cout &lt;&lt; &quot;king &quot;;<br /> };<br /> break;<br /> };<br /> cout &lt;&lt; &quot;of &quot;;<br /> switch ( hand [ i ].cardSuite )<br /> {<br /> case clubs:<br /> {<br /> cout &lt;&lt; &quot;clubs&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> case diamonds:<br /> {<br /> cout &lt;&lt; &quot;diamonds&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> case hearts:<br /> {<br /> cout &lt;&lt; &quot;hearts&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> case spades:<br /> {<br /> cout &lt;&lt; &quot;spades&quot; &lt;&lt; endl;<br /> };<br /> break;<br /> };<br /> i ++;<br /> }<br /> <br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : createHand<br /> Parameters :<br /> <br /> hand a(n) card * ( card * )  ,<br /> deck a(n) card * ( card * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void createHand ( card * hand , card * deck )<br /> {<br /> <br /> int i = 0;<br /> int cardIndex;<br /> <br /> while ( i &lt; 5 )<br /> {<br /> cardIndex = drawCard ( deck );<br /> hand [ i ].cardType = deck [ cardIndex ].cardType;<br /> hand [ i ].cardSuite = deck [ cardIndex ].cardSuite;<br /> i ++;<br /> }<br /> return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br /> <br /> Name : rebuildDeck<br /> Parameters :<br /> <br /> deck a(n) card * ( card * )<br /> <br /> <br /> Returns: Void type<br /> Comments:<br /> <br /> <br /> <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void rebuildDeck ( card * deck )<br /> {<br /> <br /> int i = 0;<br /> <br /> while ( i &lt; 52 )<br /> {<br /> deck [ i ].drawn = false;<br /> i ++;<br /> }<br /> <br /> <br /> return;<br /> }<br /> <br /> <br />

[Author]

Posts