You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...

Question

Question

You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4] [5] [6] [7] 6 9 17 29 33 41 58 61 [8] [9]

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

58

In the Binary Search algorithm, we have two-pointers start and end, and we do make comparisons with mid of start and end.

Initially , start = 0 , end = 13

so mid = (start+end)/2 = (0+13/2) = 6 ,at 6th index element is 58

so ans is 58

Add a comment

Answer 2

Similar Homework Help Questions

Please use Java recursion knowledge to solve. Given the following sorted array of integers: 1 7...

Please use Java recursion knowledge to solve. Given the following sorted array of integers: 1 7 8 11 15 22 38 What are the "middle" elements that the binary search algorithm would examine/compare to as it divides the array into sections when looking for the number 7? 1 7 8 11 15 22 38
1. (16 pts.) Sorted Array Given a sorted array A of n (possibly negative) distinct integers,...

1. (16 pts.) Sorted Array Given a sorted array A of n (possibly negative) distinct integers, you want to find out whether there is an index i for which Al = i. Give a divide-and-conquer algorithm that runs in time O(log n). Provide only the main idea and the runtime analysis.
You are given an array A of integers in sorted order. However, you do not know...

You are given an array A of integers in sorted order. However, you do not know the length n of the array. Assume that in our programming language arrays are implemented in such a way that you receive an out-of-bounds error message whenever you wish to access an element A[i] with i>n. For simplicity we assume that the error message simply returns the value INT_MAX and that every value in the array is smaller than INT_MAX. (a) Design an algorithm...

1. Please write a Divide-and-Conquer Java algorithm solving the following problem: Given an "almost sorted" array...

1. Please write a Divide-and-Conquer Java algorithm solving the following problem: Given an "almost sorted" array of distinct integers, and an integer x, return the index of x in the array. If the element x is not present in the array, return -1. "Almost sorted" means the following. Assume you had a sorted array A[0…N], and then split it into two pieces A[0…M] and A[M+1…N], and move the second piece upfront to get the following: A[M+1]…A[N]A[0]…A[M]. Thus, the "almost sorted"...
Suppose a binary tree data (in tiny written size) is stored in an array (A) as...

Suppose a binary tree data (in tiny written size) is stored in an array (A) as given below and root is placed at “0”index. Note the array indices are in larger written size (0 to 74). Show the traversal data of the given tree for a) In-Order Traversal b) Post Order Traversal A 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 3 28 13 36 15 9 22 44 7 10 75 33 19 15...
3. Write the function find sorted elt whose input is a vector sorted in increasing order...

3. Write the function find sorted elt whose input is a vector sorted in increasing order and an element x. The output is 0 if the element x does not occur in v, 1 if the element x does occur in v. Below is the algorithm you should implement, known as the binary search algorithm. Note that the code below returns the index, but we want to return true or false, not the index, so adjust your code accordingly. Algorithm....

Use C++ (2D Array) Write a program which: 1. Assigns data given below into the 2D...

Use C++ (2D Array) Write a program which: 1. Assigns data given below into the 2D array of integers which is 10x10. 2. Prints out the contents of the 2D array after assigning the data to make sure correct data was assigned. 3. Figures out and prints out the square root of the sum of ALL the elements in the 2D array. 4. Figures out and prints out the average of ALL THE ELEMENTS in the 2D array. 5. Figures...
Suppose you are given an array of n integers a1, a2, ..., an. You need to...

Suppose you are given an array of n integers a1, a2, ..., an. You need to find out the length of its longest sub-array (not necessarily contiguous) such that all elements in the sub-array are sorted in non-decreasing order. For example, the length of longest sub-array for {5, 10, 9, 13, 12, 25, 19, 70} is 6 and one such sub-array is {5, 10, 13, 19, 70}. Note you may have multiple solutions for this case. Use dynamic programming to...
Subject: Algorithm need this urgent please thank you. 4. Give pseudocode for an algorithm that will solve the following problem. Given an array A[1..n) that contains every number between 1 and n +...

Subject: Algorithm need this urgent please thank you. 4. Give pseudocode for an algorithm that will solve the following problem. Given an array A[1..n) that contains every number between 1 and n +1 in order, except that one of the numbers is missing. Find the miss sorted ing mber. Your algorithm should run in time (log n). (Hint: Modify Binary search). A pseudocode means an algorithm with if statements and loops, etc. Don't just write a paragraph. Also, if your...

4) [15 points total (5 points each)] Assume you are given a sorted array A of n numbers, where A is indexed from 1 up t...

4) [15 points total (5 points each)] Assume you are given a sorted array A of n numbers, where A is indexed from 1 up to n, anda number num which we wish to insert into A, in the proper sorted position. The function Search finds the minimum index i such that num should be inserted into Ali]. It searches the array sequentially until it finds the location i. Another function MakeRoom moves A[i], .., AIn] to Ali+1]...AIn+1] same sort...

You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...

Homework Answers

Add Answer to:
You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...

Post as a guest

Earn Coins

Please use Java recursion knowledge to solve. Given the following sorted array of integers: 1 7...

1. (16 pts.) Sorted Array Given a sorted array A of n (possibly negative) distinct integers,...

You are given an array A of integers in sorted order. However, you do not know...

1. Please write a Divide-and-Conquer Java algorithm solving the following problem: Given an "almost sorted" array...

Suppose a binary tree data (in tiny written size) is stored in an array (A) as...

3. Write the function find sorted elt whose input is a vector sorted in increasing order...

Use C++ (2D Array) Write a program which: 1. Assigns data given below into the 2D...

Suppose you are given an array of n integers a1, a2, ..., an. You need to...

Subject: Algorithm need this urgent please thank you. 4. Give pseudocode for an algorithm that will solve the following problem. Given an array A[1..n) that contains every number between 1 and n +...

4) [15 points total (5 points each)] Assume you are given a sorted array A of n numbers, where A is indexed from 1 up t...

You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...

Homework Answers

Add Answer to: You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...

Post as a guest

Earn Coins

Add Answer to:
You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...