Consider the following linear array: array=[-6,2,1,-5,-1,7,8] If you remove an element in index 2 and then insert an element in index 4, MINIMUM how many elements in total need to be shifted for the full operation? When an element in a particular index moves to its adjacent left or right index, it is counted as one shift. 5 18

Consider the following linear array: array=[-6,2,1,-5,-1,7,8] If you remove an element in index 2 and then insert an element in index 4, MINIMUM how many elements in total need to be shifted for the full operation? When an element in a particular index moves to its adjacent left or right index, it is counted as one shift. 5 18

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Code only_Given an unsorted array A of size N that contains only positive integers, find a continuous sub-array that adds to a given number S and return the left and right index(1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. Note:- You have to return an ArrayList consisting of two elements left and right. In case no such subarray exists return an array consisting of element -1..
Write code to identify an element in a sorted array of n numbers that has been rotated an unknown number of times. You may presume the array was initially sorted in ascending order.EXAMPLElnput:15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 148 as an output (the index of 5 in the array)
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…
Create a NumPy array which represents the values of the function f(x, y) = x^2 − y^2 with x ∈ [−1, 1] and y ∈ [−2, 2]. Make a contourf plot of this function .
Function 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)
Write a code in “C” that can create a [n×m] dimensional matrix. Take the values of all the elements from the user.
Array Challenge Have the function ArrayChallenge (arr) take the array of integers stored in arr, and determine if any three distinct numbers (excluding the first element) in the array can sum up to the first element in the array. For example: if arr is [8, 2, 1, 4, 10, 5, -1, -1] then there are actually three sets of triplets that sum to the number 8: [2, 1, 5], [4, 5, -1] and [10, -1, -1]. Your program should return the string true if 3 distinct elements sum to the first element, otherwise your program should return the string false. The input array will always contain at least 4 elements. Examples Input: [10, 2, 3, 1, 5, 3, 1, 4, -4, -3, -2] Output: true Input: [12, 3, 1, -5, -4, 7] Output: false
Take and Code it _sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length. Do not allocate extra space for another array; you must do this by modifying the input array in-place with O(1) extra memory..
SO You have been given two integer arrays/lists (ARR1 and ARR2) of size N and M, respectively. You need to print their intersection; An intersection for this problem can be defined when both the arrays/lists contain a particular value or to put it in other words, when there is a common value that exists in both the arrays/lists.Note :Input arrays/lists can contain duplicate elements.The intersection elements printed would be in the order they appear in the first sorted array/list (ARR1).Input format :The first line of input contains an integer 'N' representing the size of the first array/list.The second line contains 'N' single space separated integers representing the elements of the first the array/list.The third line contains an integer 'M' representing the size of the second array/list.The fourth line contains 'M' single space separated integers representing the elements of the second array/list.Output format :Print the intersection elements. Each element is printed in a separate…
Using the supplied main.cpp, help me add code for the reverseNames() function. The function should accept two arrays that are parallel, and reverse the order of the strings in the array. Because the arrays are parallel, the elements should be swapped at the same time. Do not swap the pets array, then the owner array in separate loops. Do it all in a single loop in the function. Prototypes void reverseString( string a[ ], b[ ], int size ); Function reverseString() will reverse the order of the strings in the arrays. The following is the main.cpp #include <iostream> using namespace std; void reverseNames( string [], string [], int size); int main(){ string pet[5] = {"Hobbs", "Snoopy", "Odie", "Garfield", "Pluto"}; string owner[5] = {"Calvin", "Charlie", "Jon", "Jon", "Mickey"}; cout << "Initial array values" << endl; for ( int i=0; i<5; i++){ cout << pet[i] << " " << owner[i] << endl; } reverseNames(pet, owner, 5); cout << endl <<…
In Java write an application to Find minimum and maximum in array.
numpy array (([[-13,-38,22,-41,25], [-45,29,14,-34,-49], [26,21,-44,-25,0], [-30,-32,34,-39,-22], [-21,-36,0,18,37], [37,44,46,36,-37]]) Use indexing to extract the following slicers from the array [14,-34,-49], [-44,-25,0], [34,-39,-22] [[-30,-32,34,-39,-22], [-45,29,14,-34,-49], [-21,-36,0,18,37]] [25,34,46,-36]