Skip to content
Related Articles

Related Articles

Improve Article

Find a Fixed Point (Value equal to index) in a given array

  • Difficulty Level : Easy
  • Last Updated : 09 Apr, 2021
Geek Week

Given an array of n distinct integers sorted in ascending order, write a function that returns a Fixed Point in the array, if there is any Fixed Point present in array, else returns -1. Fixed Point in an array is an index i such that arr[i] is equal to i. Note that integers in array can be negative. 
Examples: 
 

  Input: arr[] = {-10, -5, 0, 3, 7}
  Output: 3  // arr[3] == 3 

  Input: arr[] = {0, 2, 5, 8, 17}
  Output: 0  // arr[0] == 0 


  Input: arr[] = {-10, -5, 3, 4, 7, 9}
  Output: -1  // No Fixed Point

 

Method 1 (Linear Search) 
Linearly search for an index i such that arr[i] == i. Return the first such index found. Thanks to pm for suggesting this solution. 
 

C++




// C++ program to check fixed point
// in an array using linear search
#include <bits/stdc++.h>
using namespace std;
 
int linearSearch(int arr[], int n)
{
    int i;
    for(i = 0; i < n; i++)
    {
        if(arr[i] == i)
            return i;
    }
 
    /* If no fixed point present then return -1 */
    return -1;
}
 
/* Driver code */
int main()
{
    int arr[] = {-10, -1, 0, 3, 10, 11, 30, 50, 100};
    int n = sizeof(arr)/sizeof(arr[0]);
    cout << "Fixed Point is " << linearSearch(arr, n);
    return 0;
}
 
// This is code is contributed by rathbhupendra
C



// C program to check fixed point
// in an array using linear search
#include<stdio.h>
 
int linearSearch(int arr[], int n)
{
    int i;
    for(i = 0; i < n; i++)
    {
        if(arr[i] == i)
            return i;
    }
 
    /* If no fixed point present then return -1 */
    return -1;
}
 
/* Driver program to check above functions */
int main()
{
    int arr[] = {-10, -1, 0, 3, 10, 11, 30, 50, 100};
    int n = sizeof(arr)/sizeof(arr[0]);
    printf("Fixed Point is %d", linearSearch(arr, n));
    getchar();
    return 0;
}
Java



// Java program to check fixed point
// in an array using linear search
  
class Main
{
    static int linearSearch(int arr[], int n)
    {
        int i;
        for(i = 0; i < n; i++)
        {
            if(arr[i] == i)
                return i;
        }
       
        /* If no fixed point present
           then return -1 */
        return -1;
    }
    //main function
    public static void main(String args[])
    {
        int arr[] = {-10, -1, 0, 3, 10, 11, 30, 50, 100};
        int n = arr.length;
        System.out.println("Fixed Point is "
                     + linearSearch(arr, n));
    }
}
Python



# Python program to check fixed point
# in an array using linear search
def linearSearch(arr, n):
    for i in range(n):
        if arr[i] is i:
            return i
    # If no fixed point present then return -1
    return -1
 
# Driver program to check above functions
arr = [-10, -1, 0, 3, 10, 11, 30, 50, 100]
n = len(arr)
print("Fixed Point is " + str(linearSearch(arr,n)))
 
# This code is contributed by Pratik Chhajer
C#



// C# program to check fixed point
// in an array using linear search
using System;
 
class GFG
{
    static int linearSearch(int []arr, int n)
    {
        int i;
        for(i = 0; i < n; i++)
        {
            if(arr[i] == i)
                return i;
        }
         
        /* If no fixed point present
        then return -1 */
        return -1;
    }
    // Driver code
    public static void Main()
    {
        int []arr = {-10, -1, 0, 3, 10, 11, 30, 50, 100};
        int n = arr.Length;
        Console.Write("Fixed Point is "+ linearSearch(arr, n));
    }
}
 
// This code is contributed by Sam007
PHP



<?php
// PHP program to check fixed point
// in an array using linear search
 
function linearSearch($arr, $n)
{
    for($i = 0; $i < $n; $i++)
    {
        if($arr[$i] == $i)
            return $i;
    }
 
    // If no fixed point present then
    // return -1
    return -1;
}
 
    // Driver Code
    $arr = array(-10, -1, 0, 3, 10,
                  11, 30, 50, 100);
    $n = count($arr);
    echo "Fixed Point is ".
            linearSearch($arr,$n);
 
// This code is contributed by Sam007
?>
Javascript



<script>
 
// JavaScript program to check fixed point
// in an array using linear search
 
    function linearSearch(arr, n)
    {
        let i;
        for(i = 0; i < n; i++)
        {
            if(arr[i] == i)
                return i;
        }
     
        /* If no fixed point present
        then return -1 */
        return -1;
    }
 
// Driver Code
    let arr = [-10, -1, 0, 3, 10, 11, 30, 50, 100];
    let n = arr.length;
    document.write("Fixed Point is "
                + linearSearch(arr, n));
 
</script>
Output:  
Fixed Point is 3
Time Complexity: O(n)
Method 2 (Binary Search) 
First check whether middle element is Fixed Point or not. If it is, then return it; otherwise check whether index of middle element is greater than value at the index. If index is greater, then Fixed Point(s) lies on the right side of the middle point (obviously only if there is a Fixed Point). Else the Fixed Point(s) lies on left side. 
 


C++



// C++ program to check fixed point
// in an array using binary search
#include <bits/stdc++.h>
using namespace std;
 
int binarySearch(int arr[], int low, int high)
{
    if(high >= low)
    {
        int mid = (low + high)/2; /*low + (high - low)/2;*/
        if(mid == arr[mid])
            return mid;
        if(mid > arr[mid])
            return binarySearch(arr, (mid + 1), high);
        else
            return binarySearch(arr, low, (mid -1));
    }
 
    /* Return -1 if there is no Fixed Point */
    return -1;
}
 
/* Driver code */
int main()
{
    int arr[10] = {-10, -1, 0, 3, 10, 11, 30, 50, 100};
    int n = sizeof(arr)/sizeof(arr[0]);
    cout<<"Fixed Point is "<< binarySearch(arr, 0, n-1);
    return 0;
}
 
// This code is contributed by rathbhupendra
C



// C program to check fixed point
// in an array using binary search
#include<stdio.h>
 
int binarySearch(int arr[], int low, int high)
{
    if(high >= low)
    {
        int mid = (low + high)/2;  /*low + (high - low)/2;*/
        if(mid == arr[mid])
            return mid;
        if(mid > arr[mid])
            return binarySearch(arr, (mid + 1), high);
        else
            return binarySearch(arr, low, (mid -1));
    }
 
    /* Return -1 if there is no Fixed Point */
    return -1;
}
 
/* Driver program to check above functions */
int main()
{
    int arr[10] = {-10, -1, 0, 3, 10, 11, 30, 50, 100};
    int n = sizeof(arr)/sizeof(arr[0]);
    printf("Fixed Point is %d", binarySearch(arr, 0, n-1));
    getchar();
    return 0;
}
Java



// Java program to check fixed point
// in an array using binary search
 
class Main
{
    static int binarySearch(int arr[], int low, int high)
    {
        if(high >= low)
        {  
            /* low + (high - low)/2; */
            int mid = (low + high)/2; 
            if(mid == arr[mid])
                return mid;
            if(mid > arr[mid])
                return binarySearch(arr, (mid + 1), high);
            else
                return binarySearch(arr, low, (mid -1));
        }
       
        /* Return -1 if there is
           no Fixed Point */
        return -1;
    }
       
    //main function
    public static void main(String args[])
    {
        int arr[] = {-10, -1, 0, 3 , 10, 11, 30, 50, 100};
        int n = arr.length;
        System.out.println("Fixed Point is "
                   + binarySearch(arr,0, n-1));       
    }
}
Python



# Python program to check fixed point
# in an array using binary search
def binarySearch(arr, low, high):
    if high >= low:
        mid = (low + high)//2
     
    if mid is arr[mid]:
        return mid
     
    if mid > arr[mid]:
        return binarySearch(arr, (mid + 1), high)
    else:
        return binarySearch(arr, low, (mid -1))
     
    # Return -1 if there is no Fixed Point
    return -1
 
 
# Driver program to check above functions */
arr = [-10, -1, 0, 3, 10, 11, 30, 50, 100]
n = len(arr)
print("Fixed Point is " + str(binarySearch(arr, 0, n-1)))
 
 
# This code is contributed by Pratik Chhajer
C#



// C# program to check fixed point
// in an array using binary search
using System;
 
class GFG
{
    static int binarySearch(int []arr, int low, int high)
    {
        if(high >= low)
        {
            // low + (high - low)/2;
            int mid = (low + high)/2;
             
            if(mid == arr[mid])
                return mid;
            if(mid > arr[mid])
                return binarySearch(arr, (mid + 1), high);
            else
                return binarySearch(arr, low, (mid -1));
        }
         
        /* Return -1 if there is
        no Fixed Point */
        return -1;
    }
         
    // Driver code
    public static void Main()
    {
        int []arr = {-10, -1, 0, 3 , 10, 11, 30, 50, 100};
        int n = arr.Length;
        Console.Write("Fixed Point is "+ binarySearch(arr,0, n-1));    
    }
}
// This code is contributed by Sam007
PHP



<?php
// PHP program to check fixed po
// in an array using binary search
 
function binarySearch($arr, $low, $high)
{
    if($high >= $low)
    {
         
         /*low + (high - low)/2;*/
        $mid = (int)(($low + $high) / 2);
        if($mid == $arr[$mid])
            return $mid;
        if($mid > $arr[$mid])
            return binarySearch($arr, ($mid + 1), $high);
        else
            return binarySearch($arr, $low, ($mid - 1));
    }
 
    /* Return -1 if there is
       no Fixed Po*/
    return -1;
}
 
    // Driver Code
    $arr = array(-10, -1, 0, 3, 10,
                  11, 30, 50, 100);
    $n = count($arr);
    echo "Fixed Point is: "
        . binarySearch($arr, 0, $n - 1);
         
// This code is contributed by Anuj_67
?>
Javascript



<script>
 
// javascript program to check fixed point
// in an array using binary search 
 
 
function binarySearch( arr, low, high)
{
    
    if(high >= low)
    {
        let mid = Math.floor((low + high)/2); /*low + (high - low)/2;*/
         
        if(mid == arr[mid])
            return mid;
        if(mid > arr[mid])
            return binarySearch(arr, (mid + 1), high);
        else
            return binarySearch(arr, low, (mid -1));
    }
 
    /* Return -1 if there is no Fixed Point */
    return -1;
}
 
    // Driver program
    let arr = [-10, -1, 0, 3, 10, 11, 30, 50, 100];
    let n = arr.length;
    document.write("Fixed Point is "+ binarySearch(arr, 0, n-1));
     
    // This code is contributed by jana_sayantan.
</script>
Output: 
 
Fixed Point is 3
Algorithmic Paradigm: Divide & Conquer 
Time Complexity: O(Logn)
 
Find a Fixed Point (Value equal to index) in a given array | Duplicates Allowed
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.



My Personal Notes
arrow_drop_up
Next

Find the maximum element in an array which is first increasing and then decreasing
Recommended Articles
Page :
Find a Fixed Point (Value equal to index) in a given array | Duplicates Allowed
26, Jan 18
Maximum Fixed Point (Value equal to index) in a given Array
18, Jul 21
Find a Fixed Point in an array with duplicates allowed
06, Jun 17
Minimum index i such that all the elements from index i to given index are equal
11, Feb 19
Check if digit cube limit of an integer arrives at fixed point or a limit cycle
17, Sep 20
Check if it is possible to reach to the index with value K when start index is given
25, Jun 20
Farthest index that can be reached from the Kth index of given array by given operations
02, Dec 20
Check if every index i has an index j such that sum of elements in both directions are equal
04, Oct 18
Number of permutations such that sum of elements at odd index and even index are equal
02, Jul 18
Minimum value to add to arr[i] so that an array can be split at index i with equal sum
22, Mar 19
Minimize operations required to make each element of Array equal to it's index value
03, Jul 20
Minimum increments by index value required to obtain at least two equal Array elements
17, Aug 20
Queries for number of distinct elements from a given index till last index in an array
17, Jun 19
Find Equal (or Middle) Point in a sorted array with duplicates
02, Dec 16
Queries to find the minimum index in given array having at least value X
18, Jan 21
Maximum number of fixed points using atmost 1 swap
31, Oct 18
Minimize steps to form string S from any random string of length K using a fixed length subsequences
03, Aug 21
Maximum index a pointer can reach in N steps by avoiding a given index B | Set 2
15, Mar 21
Maximum index a pointer can reach in N steps by avoiding a given index B - Set 3 (Binary Search)
29, Sep 21
Find an equal point in a string of brackets
08, Apr 17
Rearrange array such that even index elements are smaller and odd index elements are greater
08, Oct 17
Sort Array such that smallest is at 0th index and next smallest it at last index and so on
08, Jul 20
Queries to calculate sum of array elements present at every Yth index starting from the index X
13, Jan 21
Minimum count of indices to be skipped for every index of Array to keep sum till that index at most T
24, Jun 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox