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
|
//Charles Blackwell CIS 211 Module 9
#include <iostream>
using namespace std;
//Function Prototype
const int number_list = 18;
bool searcharray(int entered_number, int lookup_number[number_list]);
int main()
{
int account_number[] = { 8149420, 5333174, 3080098, 6755963, 9526981,
4449539, 9387197, 5104726, 2931356, 4282637, 1750219, 6086650,
3164838, 2419590, 4578589, 9718904, 6749941, 2545408 };
int chargenumber = 0;
bool find = true;
cout << " *Charge Account Validation* " << endl;
//input of account number
cout << "_______________________________________________________________________" << endl;
cout << "Please enter the account number: " << endl;
cin >> chargenumber;
//If/else statement based on if the account number is right or wrong
find = searcharray(chargenumber, account_number);
if (find == true)
cout << "\nCharge " << chargenumber << " is a valid number" << endl;
else
cout << "\nCharge " << chargenumber << " is not a valid number" << endl;
return 0;
}
//For loop
bool searcharray(int entered_number, int lookup_number[number_list])
{
bool find = false;
for (int i = 0; i < number_list; i++)
{
if (entered_number == lookup_number[i])
return true;
}
return false;
}
void bublesort(int lookup_number[number_list], int enter_number)
{
int k, i, temp, flag;
for (k = 1; k < enter_number; k++)
{
flag = 0;
for (i = 0; i < enter_number - k; i++)
{
if (lookup_number[number_list] > lookup_number[i + 1])
{
temp = lookup_number[number_list];
lookup_number[number_list] = lookup_number[i + 1];
lookup_number[i + 1] = temp;
flag = 1;
}
}
if (flag == 0)
break;
}
|