Question

This program is in C++

Write a program that validates charge account numbers read in from the file Charges.txt following this assignment (A23 Data). Use a selection sort function on the array to sort the numbers then use a binary search to validate the account numbers. Print out the sorted list of account numbers so you can see the valid ones. Prompt the user to enter an account number and the validate that number. If the account number entered is not found, tell the user to enter a valid number. Place this in a loop so multiple values can be checked without restarting the program. Ask the user when to quit.

Answer 1

#include<bits/stdc++.h>

using namespace std;

void swap(long long int *xp, long long int *yp)  

{  

    int temp = *xp;  

    *xp = *yp;  

    *yp = temp;  

}  

/* Function to sort an acc numbers */

void selectionSort(long long int  arr[], long long int  n)  

{  

    long long int i, j, min_idx;  

  

    for (i = 0; i < n-1; i++)  

    {  

        

        min_idx = i;  

        for (j = i+1; j < n; j++)  

        if (arr[j] < arr[min_idx])  

            min_idx = j;   

        swap(&arr[min_idx], &arr[i]);  

    }  

}  

  

/* Function to print an array */

void printArray(long long int arr[], long long int size)  

{  

    long long int i;  

    for (i=0; i < size; i++)  

        cout << arr[i] << " ";  

    cout << endl;  

}  

/* Function to search an acc number */

long long int binarySearch(long long int arr[], long long int l, long long int r, long long int x)

{

    if (r >= l) {

        long long int mid = l + (r - l) / 2;

  

        if (arr[mid] == x)

            return mid;

  

        if (arr[mid] > x)

            return binarySearch(arr, l, mid - 1, x);

  

        return binarySearch(arr, mid + 1, r, x);

    }

  

    return -1;

}

int main(int argc, char const *argv[])

{

   long long int arr[130];

   ifstream myfile("data.txt");

    long long int  n=0;

   int x;

   while (n < arr[30] && myfile >> x)

   // and read integer from file

   arr[n++] = x;            

    long long int a;

    long long int i=0;

    long long int number;

    int result;

    int choice;

    

    while(1){

          cout<<"Enter the choice\n1.Check Acc Number.\n2.Quit.\n";

          cin>>choice;

             switch(choice){

                 case 1:cout<<"Enter an account number\n";

                        cin>>number;

                        while (myfile >> a)

                         {

                          arr[i++]=a;

                          }

                        

                         selectionSort(arr, n);  

                         cout << "sorted list of account numbers: \n";  

                         printArray(arr, n);  

                         result = binarySearch(arr, 0, n - 1, number);

                         (result == -1) ? cout << "account number entered is not found\n"

                           : cout << "entered account number is found\n";

                          break;

                 case 2: exit(0);

                 default:cout<<"invalid choice\n";

       }         

      }

    getchar();

  return 0;

}

Enter the choice 1. Check Acc Number. 2.Quit. Enter an account number 8965494 sorted list of account numbers: 1235553 4456667 4876523 6264555 9464565 account number entered is not found Enter the choice 1. Check Acc Number. 2.Quit. Enter an account number 59 sorted list of account numbers: 1235553 4456667 4876523 6264555 9464565 account number entered is not found Enter the choice 1. Check Acc Number. 2.Quit.