Given an array A = [10, 7, 4, 2, 1], and target = 7, return the index of the target if found, else return -1. 1. Can this problem be solved in O(logN)? 2. If so, write the implementation. Mention time and space complexity 3. If this problem cannot be solved using O(logN), what is the solution that you suggest - write the code and also mention time and space complexity.

Given an array A = [10, 7, 4, 2, 1], and target = 7, return the index of the target if found, else return -1. 1. Can this problem be solved in O(logN)? 2. If so, write the implementation. Mention time and space complexity 3. If this problem cannot be solved using O(logN), what is the solution that you suggest - write the code and also mention time and space complexity.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Consider a divide-and-conquer algorithm that calculates the sum of all elements in a set of n numbers by dividing the set into two sets of n/2 numbers each, finding the sum of each of the two subsets recursively, and then adding the result. What is the recurrence relation for the number of operations required for this algorithm? Answer is f(n) = 2 f(n/2) + 1. Please show why this is the case.
Given an unsorted array A of integers of any size, n ≥ 3, and an integer value x, write an algorithm as a pseudo code (not a program!) that would find out if there exist EXACTLY3 occurrences in the array with value x. What is the time complexity of your algorithm, in terms of Big-O? What is the space complexity of your algorithm, in terms of Big-O? What if , the given array A is sorted. Will time complexity change from the case that A was unsorted? • If yes; give a new algorithm that achieves this better complexity (indicate the time complexity as of that algorithm). • If no, explain why such new constraints/conditions cannot lead to a better time complexity.
You are given an array of integers nums and an integer target. Return the indices of two numbers in the array such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Implement a function in Java to solve this problem using a hash map, and explain the time and space complexity of your solution.
Write a programme that, given an array of N double values, a[], discovers the closest pair, or two values whose difference (in absolute value) is not higher than that of any other pair. In the worst scenario, your program's execution time should be linearithmic.
Note: Your solution should have O(n) time complexity, where n is the number of elements in l, and O(1) additional space complexity, since this is what you would be asked to accomplish in an interview. Given a linked list l, reverse its nodes k at a time and return the modified list. k is a positive integer that is less than or equal to the length of l. If the number of nodes in the linked list is not a multiple of k, then the nodes that are left out at the end should remain as-is. You may not alter the values in the nodes - only the nodes themselves can be changed.
You will analyze three algorithms to solve the maximum contiguous subsequence sum problem, and then evaluate the performance of instructor-supplied implementations of those three algorithms. You will compare your theoretical results to your actual results in a written report. What is the maximum contiguous subsequence sum problem? Given a sequence of integers A1, A2, ..., An (where the integers may be positive or negative), find a subsequence Aj, ... , Ak that has the maximum value of all possible subsequences. The maximum contiguous subsequence sum is defined to be zero if all of the integers in the sequence are negative. Consider the sequence shown below. A1: -2 A2: 11 A3: -4 A4: 13 A5: -5 A6: 2 The maximum contiguous subsequence sum is 20, representing the contiguous subsequence in positions 2, 3, and 4 (i.e. 11 + (-4) + 13 = 20). The sum of the values in all other contiguous subsequences is less than or equal to 20. Consider a second sequence, shown below. A1: 1…
An array A[1 . . n] of integers is a mountain if it consists of an increasing sequence followed by a decreasing sequence, or more precisely,If there is an index m ∈ {1, 2, . . . , n} such that• A[i] < A[i + 1] for all 1 ≤ i < m, and• A[i] > A[i + 1] for all m ≤ i < n.In particular, A[m] is the maximum element, and it is the unique “locally maximum” element surrounded by smaller elements (A[m − 1] and A[m + 1]).Give an algorithm to compute the maximum element of a mountain input array A[1 . . n] in O(log(n)) time.
I'm not sure if the question is understood here, but this problem utilizes a 2D array as OPT. OPT[i, j] = is the largest kind of increasing subsequence we can obtain ending at ai, aj. Where ai < aj and ak < ai. Is it also possible to get this solution in java?
Write a JAVA program to find maximum sum subarray such that start and end values are same for instance given arr = [9, 9,1,1,10,2,4,10] output: Subarray : (9, 9) sum= 18Subarray : (1, 1) sum= 2Subarray : (10, 2, 4, 10) sum= 26 The Subarray with the largest sum is : (10, 2, 4, 10) and the Sum is : 26
For the problem, give pseudocode for your solution, and remember to include a proof of correctness and runtime. Note that in general, faster algorithms will receive more credit, so a brute force O(n 2 ) algorithm will not get many points if there is a faster O(n) or O(n log n) alterative. In IR2 , we define a slab to be a pair of parallel lines. Given a set of points P in IR2 , find the narrowest slab containing P, where the width of the slab is the vertical distance between its bounding lines.
What is the running time for this java code? I want the complexity and asymptotic upper bound using Big-Oh notation class lcs { static void LongestCommonArraySubsequence(int X[], int Y[], int n, int m) { // dp[][] array int[][] dp = new int[n + 1][m + 1]; // dp matrix initialization for (int i = 0; i <= n; i++) for (int j = 0; j <= m; j++) dp[i][j] = 0; for (int i = n - 1; i >= 0; i--) { for (int j = m - 1; j >= 0; j--) { if (X[i] == Y[j]) dp[i][j] = dp[i + 1][j + 1] + 1; // bottom up fill } } int max = 0; // maximum length int Xindex = 0; // starting index of array X int Yindex = 0; // starting index of array Y for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { // calculating the maximum value in dp matrix if (dp[i][j] > max) {…
Given an implementation of an algorithm, you want to check formally its run-time performancebefore you apply the algorithm to big data sets, in order to prevent endless runs of algorithms on your computer.The check if your algorithm runs endlessly on this data is depending on. . . a) the length of the source code, it is a coding problem.b) function calls in the algorithm, it is a call-graph problem.c) recursion in the algorithm, it is a software design problem.d) the size of your data, it is a big data problem