Write a sequential search of an array of integers, assuming that the array is sorted into ascending order. (Hint: Consider an array that contains the four integers 2, 4, 6, and 8. How can you tell that 5 is not in the array without comparing 5 to every integer in the array?)
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
Java: An Introduction to Problem Solving and Programming plus MyProgrammingLab with Pearson eText -- Access Card Package (7th Edition)
Additional Engineering Textbook Solutions
Database Concepts (7th Edition)
Starting Out with C++: Early Objects (9th Edition)
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Starting Out with Python (4th Edition)
Concepts Of Programming Languages
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
- In this exercise, you will code a modified version of sequential search from the previous example. Here you should implement a method to do sequential search on an ArrayList of doubles and return the index of the search double, or -1 if it isn’t found using a while loop.arrow_forwardFOR JAVA Write a method that takes an integer array and returns the difference between the sum of even indexed elements and the sum of odd indexed elements in that array.arrow_forwardWrite a program that prompts the user to enter an integerm and find the smallest integer n such that m * n is a perfect square. (Hint:Store all smallest factors of m into an array list. n is the product of the factors thatappear an odd number of times in the array list. For example, consider m = 90,store the factors 2, 3, 3, and 5 in an array list. 2 and 5 appear an odd number oftimes in the array list. Thus, n is 10.) Here are some sample run: Enter an integer m: 1500 ↵EnterThe smallest number n for m * n to be a perfect square is 15m * n is 22500arrow_forward
- Implement a Binary Search algorithm, and using the results from Exercise 5, show how longthe Binary Search takes (on average) for arrays of size 10, 100, and 1000. (You do not haveto print out the values in the array).arrow_forwardWrite a program that reads an array A of N elements containing only 0's and 1's. Your program should find the position of a 0 and replace it with a 1 to get the longest continuous sequence of 1's. Let this position of 0 be called P. Print P if such a 0 exists and print -1 if the original array A contains only 1's. Assume the array indexing starts from 0.arrow_forwardLet B be an array of size n ≥ 6 containing integers from 1 to n−5 inclusive, five of which are repeated. Write and test a method for finding the five integers in B that are repeated. What is the running time of this algorithm? Hint: Sort the array B then scan it from front to end looking for the repeated entriesarrow_forward
- Write a program that first reads an integer for the array size, then reads numbers intothe array, and finally outputs how many numbers have values that are greater than theaverage. For practice reasons, try not to use the index notation of arrays (e.g. myarray[i])at all. Use pointers instead.arrow_forwardWrite method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example: Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {arrow_forwardWrite a method SortTheEvens(), that first shifts all the even numbers of an input array to the left side in that array and then sorts all even numbers in that array.Note: You are not allowed to use direct indexing and can only use ptr++ and ptr-- operators. i.e. *(ptr + i) and ptr[i] are not allowed.Do using c++ programming language.arrow_forward
- Write a program that will take the sum of the odd-indexed array elements in array of 50 integers completely filled.arrow_forwardWrite method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example:(in java) Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {arrow_forwardpublic static void reverseAscendingSubarrays(int[] items) Rearrange the elements of the given array of integers in place (that is, do not create and return a new array) so that the elements of every maximal strictly ascending subarray are reversed. For example, given the array {5, 7, 10, 4, 2, 7, 8, 1, 3}, after executing this method, the elements of the array would be {10, 7, 5, 4, 8, 7, 2, 3, 1}. Given another argument array {5, 4, 3, 2, 1}, the contents of that array would stay as {5, 4, 3, 2, 1} seeing that its each element is a maximal ascending subarray of length one. public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire…arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education