Write a program / Pseudo code / Algorithm that inserts the following numbers into two Separate arrays. L1 à 50 30 25 75 82 28 77 L2 à 50 40 25 75 80 21 37 30 After Insertion median should be calculated for each adjacent element from both array structures, after computing median print / Output that array M. if M is the median them M0 = (L1[0]+L2[0]) /2 M1 = (L1[1]+L2[1]) /2 ………….. please use c/c++ language

Write a program / Pseudo code / Algorithm that inserts the following numbers into two Separate arrays. L1 à 50 30 25 75 82 28 77 L2 à 50 40 25 75 80 21 37 30 After Insertion median should be calculated for each adjacent element from both array structures, after computing median print / Output that array M. if M is the median them M0 = (L1[0]+L2[0]) /2 M1 = (L1[1]+L2[1]) /2 ………….. please use c/c++ language

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array
Write a code in C++ / cpp to solve the following problem Sasha has an array that contains each number between 1\dots n1…n exactly once. Sasha wants to pick these numbers from 11 to nn in increasing order. On each step, she goes through the array from left to right and picks as many numbers as possible. What will be the total number of steps? Input The first input line has an integer n: the array size. The second line has n integers x1,x2,…,xn: the numbers in the array. Constraints: 1 <= n <= 2*10^5 Output Print one integer: the number of steps. Sample 1 Input 54 2 1 5 3 Output 3
Write a program in ¢++ that asks the user to enter 10 integers of an array . The program must return the position pointer of an element that is equal to the square of another element.and then print the array example:- array={2.6,8,4,5} ------- 1 is squar of 2 position=3
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
Suppose we code: theArray ={{1,2,3}, {4,5,6}, {7,8,9}}; What happens if we code System.out.println(theArray[3][3]); a) The value 9 is printed b) An error results because there is no such element as theArray[3][3] c) The entire array is printed d) None of these.
Write a program that does the following:- Prompts the user to enter 5 double floating point numbers and stores them in array A.- Creates another array B, and fills it by summing up the values of each two consecutivearray elements from array A.- Prints array B.For example, for array A = [2.2, 3.5, 6.7, 4.3, 1.5], array B will be = [5.7, 10.2, 11, 5.8]
Write a program that asks the user to type 10 integers of an array and an integer value V. The program must search if the value V exists in the array and must remove the first occurrence of V, shifting each following element left and adding a zero at the end of the array. The program must then write the final array.
Implement the following method to sort the columns in a twodimensional array. A new array is returned and the original array is intact.public static double[ ][ ] sortColumns(double[ ][ ] m) Write a test program that prompts the user to enter a 4 X 4 matrix of doublevalues and displays a new column-sorted matrix. Here is a sample run: Enter a 4−by−4 matrix row by row:0.15 0.875 0.375 0.225 ↵Enter0.55 0.005 0.225 0.015↵Enter0.30 0.12 0.4 0.008 ↵Enter0.07 0.021 0.14 0.2 ↵EnterThe column−sorted array is0.07 0.005 0.14 0.0080.15 0.021 0.225 0.0150.30 0.12 0.375 0.20.55 0.875 0.4 0.225
Write a program that will load 100 integers into arrays X. Seperate the even from the odd values elements. The procedure should be place even values in ascending order strating from the first location of the original array and place the odd values in ascending order starting from the last position of the original array.
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
Write a program to enter 10 numbers using keyboard and put them in an array.Now generate another array of same size from the array created in the first stepby satisfying the following conditions: If the number is prime then write ‘P’ to the same location of the secondarray If the number is divisible by 5 then write ‘F’ If the number is divisible by 3 then write ‘T’ If number is an Even number and neither divisible by 3 or 5 then write‘E’ If number is an Odd number and a non-prime number write ‘N’
Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.