beginners needs help

[JerrodBillingto]

i have an assignment…i cant do it…
how can i count the number i input
example
example

i input

1

4

5

12

6

1

3

4

5

how can i count if howmany 1, 4 , 5, 12, 6, 3 are there..

really need help

[GWILouisaxwzkla]

could try:

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 />

[JerrodBillingto]

thank you so very very much!…

one more question…
how can in arrange the numbers in ascending order?…happy new year!

[JerrodBillingto]

what if the program requires me to input a maximum of 20 numbers then count the number of similar numbers?…and arrange the numbers that the user input in ascending order…THANK YOU!

[GWILouisaxwzkla]

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

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; }

[Author]

Posts