Thread: Using an array, problem

Introduce two variables in the start of your program....

Code:

int index_Lower=0;
int index_Larger=0;

inside if's(), assign the value of i to these and you will get your answer....
Print the value of these two variables in the end....
Good luck...

I just provided him with algo and not the code...
Anyways, i don't think that this simple solution is that tough for him/her to think.... May be he/she is in wrong direction so that was just to put him/her in the right direction....

Introduce two variables in the start of your program....
Code:
int index_Lower=0;
int index_Larger=0;
inside if's(), assign the value of i to these and you will get your answer....
Print the value of these two variables in the end....
Good luck...

Thanks, I found that out, but can I still apply this if the number is printed out on multiple indexes?

I'm pretty sure that part of the homework involves two separate arrays.

Do you think using a pointer would help in this situation?

*shrug* Notice how a digit can appear in more than one number in the list. That means in order to display all the places such a digit occurs in the list, you may also need to efficiently store that information. Pointers don't really mean anything here, unless they point to dynamic allocations or something.

I don't get how it can print multiple indexes that smallDigit and largeDigit are on, with one int.

This is my code:

Code:

int numbers[10];
	int count;
	int smallDigit = 9;
	int largeDigit = 0;
	
	cout << "\tHow many integers? ";
	cin >> count;
	cout << "\n";
	
	
	
	
	int i;
	int numExtract;
	int temp;
	int indexSmall;
	int indexLarge;

	
	for(i = 0; i < count; i ++){
			cout << "\t\tEnter integer #" << i + 1 << " : ";
			cin >> numbers[i];

		
		
	}
		
	for(i = 0; i < count; i ++){
		
		temp = numbers[i];
		
		while (temp!= 0){
			cout << i << endl;
			if (temp < 0) {
				temp = -temp;
			}
			numExtract = temp % 10;
			temp /= 10;
		
			if( numExtract > largeDigit ){
				largeDigit = numExtract;
				indexLarge = i + 1;
			}
			if( numExtract < smallDigit ){
				smallDigit = numExtract;
				indexSmall = i + 1;

			}
			
			
		}
		
			
			
			
		
	}
	cout << "\n";
	cout << "The smallest digit: " << smallDigit << endl;
	cout << "Digit " << smallDigit << " can be found in integer number(s): " << indexSmall << endl;
	cout << "The largest digit: " << largeDigit << endl;
	cout << "Digit " << largeDigit << " can be found in integer number(s): " << indexLarge << endl;

Code:

int numbers[10];
	int count;
	int smallDigit = 9;
	int largeDigit = 0;
	
	cout << "\tHow many integers? ";
	cin >> count;
	cout << "\n";
	
	
	
	
	int i;
	int numExtract;
	int temp;
	int indexSmall;
	int indexLarge;

	
	for(i = 0; i < count; i ++){
			cout << "\t\tEnter integer #" << i + 1 << " : ";
			cin >> numbers[i];

		
		
	}
		
	for(i = 0; i < count; i ++){
		
		temp = numbers[i];
		
		while (temp!= 0){
			cout << i << endl;
			if (temp < 0) {
				temp = -temp;
			}
			numExtract = temp % 10;
			temp /= 10;
		
			if( numExtract > largeDigit ){
				largeDigit = numExtract;
				indexLarge = i + 1;
			}
			if( numExtract < smallDigit ){
				smallDigit = numExtract;
				indexSmall = i + 1;

			}
			
			
		}
	cout << "\n";
	cout << "The smallest digit: " << smallDigit << endl;
	cout << "Digit " << smallDigit << " can be found in integer number(s): " << indexSmall << endl;
	cout << "The largest digit: " << largeDigit << endl;
	cout << "Digit " << largeDigit << " can be found in integer number(s): " << indexLarge << endl;
		
			
			
		
	}

Try this.....

This'll print smallest and largest digit and their indexes each time it completes comparisons with the inner loop.....
Now, you can think to make it much better....