9. Implement an array with values 1, 5, 14, 23, 45, 52, 58, 81, 82 91.a) Create a getindex( function which does a linear search upon the array fora specific value n. Return the index of n, or -1 ifn does not exist,b) Print the array.c) Search the array for the values 23, 58, 11, rint the reaults.Qutpur Examnle15 14 23 45 52 58 71 82 91Number 23 is located at indexNumber 58 As located at index CNumber 11 i looated at index -1

Solving the given problem by using C++, as no programming language is specified. The below given…

Answered: 9. Implement an array with values 1, 5,…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write pseudo code for bubble sort and dry run that pseudo code for an array with elements. 14, 33, 27, 35, 10
6. The following piece of code computes and prints the sum of all the of odd values in the array Integer. Locate the errors and show how to fix them. int Integer[] = (-9,8,10,2,1,-1,4,-7, 3, 12]; int i; S; while (i <= 10) { if (182) S+=Integer (i); i; } printf("%f", S);
Part 2: Unroll Write a function called unroll, which takes in a square array of arrays (i.e. a grid with n rows and n columns). An input could look like this: const square = [ [1, 2, 3, 4], [5, 6, 7, 8], ]; [9, 10, 11, 12], [13, 14, 15, 16] unroll should take in such a square array and return a single array containing the values in the square. You should obtain the values by traversing the square in a spiral: from the top- left corner, move all the way to the right, then all the way down, then all the way to the left, then all the way up, and repeat. For the above example, unroll should return [1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9, 5, 6, 7, 11, 10].
Assignment #6 - Array Practice Due: Wed, Nov 16 Objective To gain practice with arrays and common array algorithms, as well as the use of array parameters in functions. Task This assignment will consist of writing several functions that manipulate arrays or access data from arrays, as well as a test program that will allow interactive testing of the array functions. Part 1: Functions Write the following functions. Each one takes in an integer array as a parameter, and other necessary parameters are returns are described. Make sure the parameters are in the order specified. Make sure to use the const qualifier on the array parameter on any function where it is appropriate. A sample CALL is given for each function. • Insert Write a function called Insert that takes in four parameters: o an integer array o the size of the array o the new value to be inserted into the array o the index at which to insert the new value This function should insert a a new value into the array, at the…
Read in an integer n (n < 25). Read n integers in an array A. Then do the following (writeseparate programs for each, only the reading part is common).a) Find the sum of the absolute values of the integers.b) Copy the positive and negative integers in the array into two additional arrays B and Crespectively. Print A, B and C.c) Exchange the values of every pair of values from the start (so exchange A[0] and A[1],A[2] and A[3] and so on). If the number of elements is odd, the last value should stay thesame.
nputer Science I| for Majors home > 13.4: Recursive Helper Methods E zyBa Feedb PARTICIPATION 13.4.3: Compute recursively to determine the sum of values in an array. АCTIVITY Assume you have the following method: public static int sum(int [] a) To compute the sum of the values in an array, add the first value to the sum of the remaining values, computing recursively. Rearrange the following lines to design a recursive helper method to solve this problem. Not all lines are useful. Mouse: Drag/drop Keyboard: Grab/release Spacebar (or Enter). Move 0000 Cancel Esc Unused FindSum.java Load default template.. return a[start] + sumHelper(a, start - 1); import java.util.Scanner; return alstart] + sumHelper(a, start + 1); public class FindSum { if (start == a. length) { return a[start); } if (start == a.length - 1) { return alstart]; } public static int sum(int[0 a) if (a.length == 0) { return -1; } return sumHelper(a, 0); if (a.length == 0) { return 0; } public static int sumHelper(int [] a,…
DO NOT POST EXISTING ONE: Write a java method called SearchKey that return the indices of the first and the last occurences of an element k in an array.The function should Return [-1,1] in case the element was not found
Question 3: An array listA is called balanced if it stores the same count of even and odd integers. Write a program to test an array listA filled with 10 integers {22,5,18,4, 9,12,13,17, 23,24}. Then the program will output the integers stored in listA and from initializer list an as follow: checks if the array listA is balanced or not. Sample Run: listA store: (22 5 18 4 9 12 13 17 23 24} listA is a balanced array am
Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 int last0f(const int a[], int alen, const int b[], int bLen) { 3 4 5 6 7 8 }
//Required Functionvoid func(int array_1[],int array_2[],int size){ for(int i=0;i<size;i++){ if(array_2[i]>array_1[i]){ array_1[i]=array_2[i]; } } return;} //main function to test the function.int main(){ int size=6; int a[]={1,5,9,8,7,6}; int b[]={1,4,10,12,7,15}; printf("First array before function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } func(a,b,size); //call to the created function printf("\nFirst array after function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } return 0;} 1. Write the statements to do the following: write a prototype for your function in the previous problem write a main function which includes the following steps declare two arrays of ints with 25 elements each prompt the user and read values into both arrays call your function from the previous problem print both arrays
C++
Question 1 [ • Take an array A of size 10 • Take 10 random numbers with values from 0-20 and put them in the array one by one. • Do not sort the array • Write a method for linear search, but you do the search from right to left (not from left to right) • Output the array • Use this method to search the key = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 one by one for the same input array • Count the number of comparisons taken by each search • Output the number of comparison and "found at position " with position found, or "not found" for each search • Give your screen picture for all search together • Put your java code Example java code for searching from left to right (but you do from right to left). There may be error in the code, but you have to do correctly:

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS