Scribd
Upload
85 views1 page

Challenging Tasks 1D

The document describes 5 programming challenges: 1. Write a program to validate a charge account number by searching a list of valid numbers stored in an array. 2. Write a program to check if a user's lottery ticket numbers match the winning numbers by searching an array. 3. Modify the lottery program to use a binary search instead of a linear search. 4. Modify the account validation program to use a binary search after sorting the array with selection sort. 5. Modify the selection sort algorithm to sort an array of strings instead of integers.

Uploaded by

Sadiq Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
85 views1 page

Challenging Tasks 1D

The document describes 5 programming challenges: 1. Write a program to validate a charge account number by searching a list of valid numbers stored in an array. 2. Write a program to check if a user's lottery ticket numbers match the winning numbers by searching an array. 3. Modify the lottery program to use a binary search instead of a linear search. 4. Modify the account validation program to use a binary search after sorting the array with selection sort. 5. Modify the selection sort algorithm to sort an array of strings instead of integers.

Uploaded by

Sadiq Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Challenging Tasks 1D (PF)

1. Write a program that lets the user enter a charge account number. The program should determine if
the number is valid by checking for it in the following list:
5658845 4520125 7895122 8777541 8451277 1302850 8080152
4562555 5552012 5050552 7825877 1250255 1005231 6545231
3852085 7576651 7881200 4581002
The list of numbers above should be initialized in a single-dimensional array. A simple linear search should
be used to locate the number entered by the user. If the user enters a number that is in the array, the
program should display a message saying that the number is valid. If the user enters a number that is not in
the array, the program should display a message indicating that the number is invalid.

2. A lottery ticket buyer purchases 10 tickets a week, always playing the same 10 5-digit “lucky”
combinations. Write a program that initializes an array or a vector with these numbers and then lets
the player enter this week’s winning 5-digit number. The program should perform a linear search
through the list of the player’s numbers and report whether or not one of the tickets is a winner this
week. Here are the numbers:
13579 26791 26792 33445 55555 62483 77777 79422 85647 93121

3. Modify the program you wrote for Programming Challenge 2 (Lottery Winners) so it performs a binary
search instead of a linear search.

4. Modify the program you wrote for Problem 1 (Charge Account Validation) so it performs a binary
search to locate valid account numbers. Use the selection sort algorithm to sort the array before the
binary search is performed.

5. Modify the selectionSort function presented in this chapter so it sorts an array of strings instead of an
array of int s. Test the function with a driver program. Use Program 8-8 as a skeleton to complete.
#include <iostream>
#include <string>
using namespace std;
int main(){
const int NUM_NAMES = 20;
string names[NUM_NAMES] = {"Collins, Bill", "Smith, Bart", "Allen, Jim", "Griffin, Jim",
"Stamey, Marty", "Rose, Geri","Taylor, Terri", "Johnson, Jill", "Allison, Jeff", "Looney,
Joe",
"Wolfe, Bill","James, Jean", "Weaver, Jim", "Pore, Bob", "Rutherford, Greg", "Javens,
Renee" ,
"Harrison, Rose", "Setzer, Cathy","Pike, Gordon", "Holland, Beth" };
// Insert your code to complete this program
return 0;
}

You might also like