You are give a matrix (a list of lists) of DISTINCT integers and a target number. Each row in the matrix is SORTED and each column in the matrix is SORTED. Our matrix does not necessarily have the same height and width. Write a function that returns a list of the row and column indices of the target integer

You are give a matrix (a list of lists) of DISTINCT integers and a target number. Each row in the matrix is SORTED and each column in the matrix is SORTED. Our matrix does not necessarily have the same height and width. Write a function that returns a list of the row and column indices of the target integer

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

(a) Write a function matrix_multiply(mat1, mat2) that takes two matrices and returns the result of the matrix multiplication between mat1 and mat2. If the two matrices are not compatible with multiplication, then None should be returned. (b) Write a function print_sums(list1, list2) that takes two equal-length lists of numbers and prints all the sums of the corresponding elements. Thus the first line is the sum of the first element of list1 and the first element of list2, the second line is the sum of the second elements, and so on.
Write a Python function countEvens that consumes an integer N and a nested list representing a matrix of arbitrary size (but larger than NxN). The function returns the number of even numbers in the NxN sub-matrix of the first N rows and columns. Note: You may assume the list argument passed to the function is a nested list of integers, but it may be larger than NxN!
TROUBLESHOOT my PYTHON code, please :) The code of a sequential search function is shown on textbook page 60. In fact, if the list is already sorted, the search can halt when the target is less than a given element in the list. For example, given my_list = [2, 5, 7, 9, 14, 27], if the search target is 6, the search can halt when it reaches 7 because it is impossible for 6 to exist after 7. Define a function linearSearchSorted, which is used to search a sorted list. This function displays the position of the target item if found, or 'Target not found' otherwise. It also displays the elements it has visited. To test your function, search for these targets in the list [2, 5, 7, 9, 14, 27]: 2, 6, 14, 27 and 28. Expected output: List: [2, 5, 7, 9, 14, 27] Search target: 2 Elements visited: 2 Target found at position 0 Search target: 6 Elements visited: 2 5 7 Target not found Search target: 14 Elements visited: 2 5 7 9 14 Target found at position 4 Search target: 27 Elements visited: 2…
(This if for mindtap on cengage, if not possible, use devc++ 5.11 but mindtap is more accurate) Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. An example of the program is shown below: (look at picture) You can use the following integer lists to test your code: 56, 34, 67, 54, 56, 87, 66, 92, 15, 32, 55, 54, 88, 92, 30 79, 26, 97, 87, 73, 44, 67, 46, 55, 13, 20, 20, 33, 42, 60 63, 1, 40, 81, 30, 11, 26, 44, 98, 1, 80, 98, 15, 3, 42
Write a function biggest_gap(L) that takes a list L of real numbers or integers and finds the largest difference |a−b| between two adjacent elements a and b. The function should return |a−b| and the index of the second element in the list. As an example, a correctly written biggest_gap should return 25,2 when run on L=[7, 13, 38, 43, 53]. Test your function on the array A and show the result. A = [12, 45, 23, 22, 42, 15, 17, 15, 73, 36, 7, 13, 38, 43, 53, 86, 40, 45, 63, 74]
in c++ please Write a function called Replace All that cerpts two parameters a matrix of 100 elements of type inter and an interval y. The function must - Replace every positive matrix element by the values +5and Replace every negative matrix element by the value - 5 and - Replace every mero try the value y.
Please do write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq".
Write a python program and add a function called add_matrix() to it. This functiontakes two 2-D lists of integers (matrix) as parameters and computes their sum, if a sumcan actually be computed. Otherwise, it returns an empty list. Note that, two matrices canonly be added together if they have the exact same dimensions. If the dimensions areacceptable, then the resulting matrix will also have the same dimensions as its operands,and the value of each element in the resulting matrix is the sum of the correspondingelements in the input matrices.Hint: test rectangularity (the number of rows and the number of elements in each rowmust be the same in two matrices) before attempting addition.Sample output:>>> matrix1 = [[2,3], [4,5]]>>> matrix2 = [[9,0], [8,6]]>>> print(add_matrix(matrix1, matrix2))[[11, 3], [12, 11]]
Consider there is a list i.e. listA = {20, 10, 5, 15, 3} Write python code that: a. Creates a function updateListA(), which takes listA as input parameter, adds 30 after 20, and adds 40 at the end of the listA. [Hint: create a parameterized function] b. Creates a function newList(), which takes listA as input parameter and creates a new list newList with same elements as listA but in reverse order. c. If there is a function defined as below: def example(par1, par2=30): print(‘valid’) From the following function calls: i. example(par1=1) ii. example(1, 2) iii. example(par2=1) iv. example(par1=5, par2=6) Which call is valid? Write the values of par1 and par2 if a call is valid? Suggest corrections if a call is invalid.
def remove_occurences[T](xs:List[T], elem: T, n:Int) : List[A] = {} Using the function above, can you show me how to make a polymorphic function in scala where the program removes elem , n number of times from the list. If n > elem then remove all elem from the list For example: remove_occurences(List(4,5,6,7,4),4,1) -> List(5,6,7,4)remove_occurences(List(4,5,6,7,4),4,2) -> List(5,6,7)remove_occurences(List(4,5,6,7,4),2,2) -> List(4,5,6,7,4)
Please answer it in Python Write a function show_plateau that takes as an argument a dictionary dligns representing the 4 lines of cards currently present on the game table. This function will dry out the card lines according to the format of the example below It will be noted that, thanks to the tabs, the second cards of each line are aligned to the left, and so continued for each of the cards. For example, show_plateau({1: [27], 2: [2, 5, 25], 3: [93], 4: [30, 41]}) #return => Lig 1 : 27 Lig 2 : 2 5 25 Lig 3 : 93 Lig 4 : 30 41
Create a function append(v, a, n) that adds to the end of vector v a copy of all the elements of array a. For example, if v contains 1,2, 3, and a contains 4, 5, 6, then v will end up containing 1, 2, 3, 4, 5,6. The argument n is the size of the array. The argument v is a vector ofintegers and a is an array of integers. Write a test driver.