EBK STARTING OUT WITH C++ FROM CONTROL
9th Edition
ISBN: 8220106714379
Author: GADDIS
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem 3RQE
Program Plan Intro
Linear search:
- Linear search or sequential search is the process of searching for a particular element that is present in the array one by one till the last element in the search element is found.
- The search uses a loop that iterates from the beginning till the last element to find the search element.
- The search continues for all the elements present in the array until the last element.
- The search of the target element is made after comparing it with each and every element that is present in the array.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
AIM: Write a program to do Linear Search using a given Search Key in an un-
sorted Linear Array 'A' which has N values in it.
Description:
The linear search compares each element of the array with the search key until the
search key is found. To determine that a value is not in the array, the program must
compare the search key to every element in the array 'A'. It is also called "Sequential
Search" because it traverses the data sequentially to locate the element.
Algorithm: (Linear Search)
LINEAR
SEARCH (A, N, SKEY)
Here A is a Linear Array with N elements and SKEY is a given item
of information to search. This algorithm finds the location of SKEY in
A and if successful, it returns its location otherwise it returns -1 for
unsuccessful.
1.
Repeat step-2 for K = 0 to N-1
2. if(A [K] = SKEY) return K [Successful Search]
[End of loop of step-1 ]
3. return -1 [Un-Successful]
4. End.
In C++ language
Write a function that takes a 2 Demensional array and returns the position of the first row with an odd sum. Assume that the column size is fixed at 4. If no sum is odd, return -1.
What happens when your program attempts to access an array element with an invalid index?
Chapter 8 Solutions
EBK STARTING OUT WITH C++ FROM CONTROL
Ch. 8.2 - Prob. 8.1CPCh. 8.2 - Prob. 8.2CPCh. 8.2 - Prob. 8.3CPCh. 8.2 - Prob. 8.4CPCh. 8 - Prob. 1RQECh. 8 - If a linear search function is searching for a...Ch. 8 - Prob. 3RQECh. 8 - A binary search function is searching for a value...Ch. 8 - What is the maximum number of comparisons that a...Ch. 8 - Prob. 6RQE
Ch. 8 - Why is the selection sort more efficient than the...Ch. 8 - Prob. 8RQECh. 8 - The __________ search algorithm repeatedly divides...Ch. 8 - Prob. 10RQECh. 8 - The ____________ search algorithm requires that...Ch. 8 - If an array is sorted in ______________ order, the...Ch. 8 - If an array is sorted in _____________ order, the...Ch. 8 - Prob. 14RQECh. 8 - Prob. 15RQECh. 8 - Prob. 16RQECh. 8 - T F The maximum number of comparisons performed by...Ch. 8 - Prob. 18RQECh. 8 - Charge Account Validation Write a program that...Ch. 8 - Lottery Winners A lottery ticket buyer purchases...Ch. 8 - Lottery Winners Modification Modify the program...Ch. 8 - Charge Account Validation Modification Modify the...Ch. 8 - Rainfall Statistics Modification Modify the...Ch. 8 - String Selection Sort Modify the selectionSort...Ch. 8 - Binary String Search Modify the binarySearch...Ch. 8 - Search Benchmarks Write a program that has an...Ch. 8 - Sorting Benchmarks Write a program that uses two...Ch. 8 - Sorting Orders Write a program that uses two...Ch. 8 - Using FilesString Selection Sort Modification...
Knowledge Booster
Similar questions
- what is the maximum number of comparisons that a Binary Search function will make when searching for a value in a 100-element array?arrow_forwardUsing C languagearrow_forwardWrite a function max_matrix(M) that takes in a non-empty matrix (a 2-dimensional array) of real numbers M and returns its maximum value. You must use loops in your code. In pythonarrow_forward
- Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…arrow_forwardInstead of utilizing an array, would it be beneficial to work with vectors instead?arrow_forwardPython Write a Python program that performs a linear (sequential) search. Define an array of 10 non-sequential numbers. Ask the user for a number, such as "Enter a number to be found:" Search the array for the user's number. If present, display "Successful search, the element is found at position " and its position. Otherwise, display "Number not found."arrow_forward
- How does a selection sort work for an array?arrow_forwardA left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example:d=2arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d: the amount to rotate by 2. int arr[n]: the array to rotate Returns 1. int[n]: the rotated array Input Format: The first line contains two space-separated integers that denote n, the number of integers, and d, the number of left rotations to perform.The second line contains n space-separated integers that describe arr[]. Constraints: 1. 1<=n<=10^5 2. 1<=d<=n 3. 1<=a[i]<=10^6arrow_forwardThe index type of an array may be any kind of data. Do you believe this to be true?arrow_forward
- If a sequential search method is searching for a value that is stored in the last element of a 10,000-element array, how many elements will the search code have to read to locate the value?arrow_forwardWrite a function that displays an n-by-n matrix using the following header: void printMatrix(int n)Each element is 0 or 1, which is generated randomly. Write a test program that prompts the user to enter n and displays an n-by-n matrix.arrow_forwardFunction PrintArray(integer array(?) dataList) returns nothing integer i for i = 0; i < dataList.size; i = i + 1 dataList[i] = Get next input Put dataList to output Put "_" to output // Your solution goes here. Modify as needed i = 0 Complete the PrintArray function to iterate over each element in dataList. Each iteration should put the element to output. Then, put "_" to output. Ex: If dataList's elements are 2 4 7, then output is: 2_4_7_ Function Main() returns nothing integer array(3) userNums integer i for i = 0; i < userNums.size; i = i + 1 userNums[i] = Get next input PrintArray(userNums)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage