Write a program in C to implement the sequential search algorithm of Chapter 3, Figure 3.1, except that instead of searching a list of telephone numbers for a particular number, have the program search a list of integers for a particular integer. Use the same input mechanism as in the data cleanup programs of Section 9.3.2 to get the list of integers to be searched. Then get the target number to be searched for. The program should output “Successful search, the value is in the list” or “Unsuccessful search, the value is not in the list.” Be sure to test your program for both outcome.

Write a program in C to implement the sequential search algorithm of Chapter 3, Figure 3.1, except that instead of searching a list of telephone numbers for a particular number, have the program search a list of integers for a particular integer. Use the same input mechanism as in the data cleanup programs of Section 9.3.2 to get the list of integers to be searched. Then get the target number to be searched for. The program should output “Successful search, the value is in the list” or “Unsuccessful search, the value is not in the list.” Be sure to test your program for both outcome.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Write a program to find the number of times that a given word occurs in a sentence using pointers. Read data from standard input. The first line is a single word, which is followed by general text on the second line. Read both up to a new line character, and insert a terminating null before processing. Typically output should be : The word is “ the ”. The sentence is “ the cat on the mat “ . The word occurs 2 times.
Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list
Write a program to find the number of times that a given word occurs in a sentence using pointers. Read data from standard input. The first line is a single word, which is followed by general text on the second line. Read both up to a new line character, and insert a terminating null before processing. Typically output should be : The word is “ the ”. The sentence is “ the cat on the mat “ . The word occurs 2 times. IN C LANGUAGE
Write a C++ program that takes an char array of size twenty. Take input a sorted array from the user. Display the char array on console such that each row has only five elements separated by spaces. Then, you are required to then take a char x from the user and use binary search to search for element x in the array. Display the index of the element on the console. Also display two elements before and after the element x. Note: Don't use functions and strings.
Write a program in c++ to generate a solution to the Sudoku game using the local search for CSP. The objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 sub-grids that compose the grid contain all of the digits from 1 to 9. Your program should print the output like the following example: Use the operation of swapping two random numbers to be your action of generating a child for the current node. Your program should start by generating a random 9x9 square (note that each number should appear 9 times) and then start improving on this state until reaching a goal by the guidance of the fitness function. If your code doesn’t reach a solution after 10 seconds then print out the reached state anyway.
Help me please... Create a program that would accept 10 strings from the user (each string has a maximum of 10 characters, letters only, no spaces). Your goal now is to sort them in lexicographical order (dictionary order) regardless of the case. You need to implement the functions toLowerCase and toUpperCase. You are free to use any sorting algorithm discussed. Example: Give me word number 1: banana Give me word number 2: apple Give me word number 3: asdfer Give me word number 4: zerosx Give me word number 5: banerZ Give me word number 6: ApPle Give me word number 7: ChoP Give me word number 8: chop Give me word number 9: ZerosX Give me word number 10: zErosx
Write in c language please, The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index n as a parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.
In c++ and without the use of vectors, please. Thanks very much! A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3…
PLEASE ASSIST ON THE BELOW REVIEW Before the user can read an email, they have to see the emails. To achieve this, your program should first of all determine which emails have not been read and return that to the user. Then the user can choose. The emails should be numbered so that the user can provide the number as the index. Consider using the enumerate function to achieve this. I realise that there are no emails within the email box , kindly add some dummy emails in this list so that at least there is something within the inbox list.Do the same for marks as spam. Present to the user all the emails that have not been marked as spam for the user to mark as spam.Most importantly, your code is not well indented. Try to work on your indentation as it makes your code easier to read and the logic easier to follow. Indentation is key in python to define the blocks of statements. The number of spaces must be uniform in a block of code. It is preferred to use four whitespaces instead of tabs…
In c++, please. Thank you! A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe 123-5432 Linda…
Computer Science In a file named Exercise2.c write the function double sum(double (*f)(double), int start, int end); The call sum(g,i,j) should return g(i)+…+g(j). Add a main function to illustrate the use of your implementation of sum applied to sqrt from 1 to 10.
A supermarket wants to reward its best customer of each day, showing the customer’s name on a screen in the supermarket. For that purpose, the customer’s purchase amount is stored in a list and the customer’s name is stored in a corresponding list. Implement a function nameOfBestCustomer that returns the name of the customer with the largest sale. def nameOfBestCustomer(sales, customers) Write a program that prompts the cashier to enter all prices and names, adds them to two lists, calls the function that you implemented, and displays the result. Use a price of 0 as a sentinel. Make sure that you use functions in your solution, including a main function.