Breaking News: Grepper is joining You.com. Read the official announcement!

: Search an element in rotated and sorted array

Add Answer

Golu Rawat answered on August 13, 2020 Popularity 9/10 Helpfulness 1/10

answer : Search an element in rotated and sorted array

related search in a rotated sorted array

related search in rotated sorted array

related Search in Rotated Sorted Array

related Search in a Rotated Array

related Search an elemnt in a sorted and rotated array

related Search in Rotated Sorted Array

: Search an element in rotated and sorted array

Comment

/* Java program to search an element
   in a sorted and pivoted array*/
 
class Main {
 
    /* Searches an element key in a
       pivoted sorted array arrp[]
       of size n */
    static int pivotedBinarySearch(int arr[], int n,
                                   int key)
    {
        int pivot = findPivot(arr, 0, n - 1);
 
        // If we didn't find a pivot, then
        // array is not rotated at all
        if (pivot == -1)
            return binarySearch(arr, 0, n - 1, key);
 
        // If we found a pivot, then first
        // compare with pivot and then
        // search in two subarrays around pivot
        if (arr[pivot] == key)
            return pivot;
        if (arr[0] <= key)
            return binarySearch(arr, 0, pivot - 1, key);
        return binarySearch(arr, pivot + 1, n - 1, key);
    }
 
    /* Function to get pivot. For array
       3, 4, 5, 6, 1, 2 it returns
       3 (index of 6) */
    static int findPivot(int arr[], int low, int high)
    {
        // base cases
        if (high < low)
            return -1;
        if (high == low)
            return low;
 
        /* low + (high - low)/2; */
        int mid = (low + high) / 2;
        if (mid < high && arr[mid] > arr[mid + 1])
            return mid;
        if (mid > low && arr[mid] < arr[mid - 1])
            return (mid - 1);
        if (arr[low] >= arr[mid])
            return findPivot(arr, low, mid - 1);
        return findPivot(arr, mid + 1, high);
    }
 
    /* Standard Binary Search function */
    static int binarySearch(int arr[], int low, int high,
                            int key)
    {
        if (high < low)
            return -1;
 
        /* low + (high - low)/2; */
        int mid = (low + high) / 2;
        if (key == arr[mid])
            return mid;
        if (key > arr[mid])
            return binarySearch(arr, (mid + 1), high, key);
        return binarySearch(arr, low, (mid - 1), key);
    }
 
    // main function
    public static void main(String args[])
    {
        // Let us search 3 in below array
        int arr1[] = { 5, 6, 7, 8, 9, 10, 1, 2, 3 };
        int n = arr1.length;
        int key = 3;
        System.out.println(
            "Index of the element is : "
            + pivotedBinarySearch(arr1, n, key));
    }
}

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: element search whatever

Link to this answer
Share Copy Link

Contributed on Aug 24 2022

Golu Rawat

0 Answers Avg Quality 2/10

Closely Related Answers

search in a rotated sorted array

Comment

class Solution {
    public int search(int[] nums, int target) {
        int start = 0, end = nums.length - 1;
        while (start <= end) {
            int mid = ( start + end) / 2;
            if (nums[mid] == target) {
                return mid;
            }
            if (nums[start] <= nums[mid]) {
                if (nums[start] <= target && target < nums[mid]) {
                    end = mid -1;
                }
                else {
                    start = mid + 1;
                }
            }
            else{
                if (nums[mid] < target && target <= nums[end]) {
                    start = mid + 1;
                }
                else {
                    end = mid -1;
                }
            }
        }
        return -1;
    }
}

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: search se

Link to this answer
Share Copy Link

Contributed on Oct 29 2022

Sumit Rawal

0 Answers Avg Quality 2/10

search in rotated sorted array

Comment

//pseudocode
function search( arr[], key, low, high)

        mid = (low + high) / 2

        // key not present
        if(low > high)
                return -1

        // key found
        if(arr[mid] == key)
                return mid

        // if left half is sorted.
        if(arr[low] <= arr[mid])

                // if key is present in left half.
                if (arr[low] <= key && arr[mid] >= key) 
                        return search(arr,key,low,mid-1)

                // if key is not present in left half..search right half.
                else                 
                        return search(arr,key,mid+1,high)
                end-if

        // if right half is sorted. 
        else    
                // if key is present in right half.
                if(arr[mid] <= key && arr[high] >= key) 
                        return search(arr,key,mid+1,high)

                // if key is not present in right half..search in left half.
                else
                        return search(arr,key,low,mid-1)
                end-if
        end-if  

end-function

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: stackoverflow.com

Tags: search se

Link to this answer
Share Copy Link

Contributed on Aug 13 2020

Outstanding Owl

0 Answers Avg Quality 2/10

Search in Rotated Sorted Array

Comment

public class Solution {
    public int Search(int[] nums, int target) {
        
    }
}

Popularity 9/10 Helpfulness 1/10 Language csharp

Source: Grepper

Tags: c# search se

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

CodeBlack reactor

0 Answers Avg Quality 2/10

Search in a Rotated Array

Comment

class Solution{

    public:

    int search(int A[], int l, int h, int key){

    //complete the function here

    for(int i=0;i<h+1;i++)

    {

        if(A[i]==key)

        {

            return i;

        }

    }

    return -1;

   

    }

}.

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: practice.geeksforgeeks.org

Tags: search se

Link to this answer
Share Copy Link

Contributed on Jun 23 2022

Vishal Patidar

0 Answers Avg Quality 2/10

Search an elemnt in a sorted and rotated array

Comment

<script>
  
// Search an element in sorted and rotated
// array using single pass of Binary Search
  
// Returns index of key in arr[l..h] if
// key is present, otherwise returns -1
function search(arr, l, h, key){
    if (l > h)
        return -1;
  
    let mid = Math.floor((l + h) / 2);
    if (arr[mid] == key)
        return mid;
  
    /* If arr[l...mid] is sorted */
    if (arr[l] <= arr[mid]) {
        /* As this subarray is sorted, we can quickly
        check if key lies in half or other half */
        if (key >= arr[l] && key <= arr[mid])
            return search(arr, l, mid - 1, key);
        /*If key not lies in first half subarray, 
           Divide other half  into two subarrays,
           such that we can quickly check if key lies 
           in other half */
        return search(arr, mid + 1, h, key);
    }
  
    /* If arr[l..mid] first subarray is not sorted, 
    then arr[mid... h]
    must be sorted subarray */
    if (key >= arr[mid] && key <= arr[h])
        return search(arr, mid + 1, h, key);
  
    return search(arr, l, mid - 1, key);
}
  
// Driver program
let arr = [ 4, 5, 6, 7, 8, 9, 1, 2, 3 ];
let n = arr.length;
let key = 3;
let i = search(arr, 0, n - 1, key);
if (i != -1)
    document.write("Index: " +i +"\n");
else
    document.write("Key not found");
      
</script>

Popularity 9/10 Helpfulness 1/10 Language javascript

Source: www.geeksforgeeks.org

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Jul 25 2022

Fragile Frog

0 Answers Avg Quality 2/10

Search in Rotated Sorted Array

Comment

class Solution {
public:
    int search(vector<int>& nums, int target) {
        
    }
};

Popularity 9/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ search se

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

CodeBlack reactor

0 Answers Avg Quality 2/10

Search in Rotated Sorted Array

Comment

class Solution {
    public int search(int[] nums, int target) {
        
    }
}

Popularity 9/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java search se

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

CodeBlack reactor

0 Answers Avg Quality 2/10

Search in Rotated Sorted Array

Comment


int search(int* nums, int numsSize, int target){

}

Popularity 9/10 Helpfulness 1/10 Language c

Source: Grepper

Tags: c search

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

CodeBlack reactor

0 Answers Avg Quality 2/10

Search in Rotated Sorted Array

Comment

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var search = function(nums, target) {
    
};

Popularity 9/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

CodeBlack reactor

0 Answers Avg Quality 2/10

Search in Rotated Sorted Array

Comment

# @param {Integer[]} nums
# @param {Integer} target
# @return {Integer}
def search(nums, target)
    
end

Popularity 9/10 Helpfulness 1/10 Language ruby

Source: Grepper

Tags: ruby search sear

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

CodeBlack reactor

0 Answers Avg Quality 2/10

: Search an element in rotated and sorted array

Contents

More Related Answers

: Search an element in rotated and sorted array

Closely Related Answers

search in a rotated sorted array

search in rotated sorted array

Search in Rotated Sorted Array

Search in a Rotated Array

Search an elemnt in a sorted and rotated array

Search in Rotated Sorted Array

Search in Rotated Sorted Array

Search in Rotated Sorted Array

Search in Rotated Sorted Array

Search in Rotated Sorted Array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.