25.Indexed sequential search(DS)

#include<conio.h>
#include<stdio.h>
#define size 5
int createindex(int x[],int n,int index[])
{
    int i,j=0;
    for(i=0;i<n;i=i+size)
        index[j++]=x[i];
    index[j++]=x[n-1];
    return j;
}
int indexsearch(int x[],int n,int index[],int m,int ele)
{
    int i,j,k;
    if(ele<x[0]||ele>x[n-1])
        return 0;
    for(i=0;i<m;i++)
    {
        if(ele<=index[i])
            break;
    }
    j = i*size;
    if(j>n-1)
        j=n-1;
    for(k=j;k>=i-1+size;k--)
    {
        if(ele>=x[k])
            break;
    }
    if(ele==x[k])
        return 1;
    else return 0;
}
int main()
{
    int i,j,k,n,x[100],ele,m,index[100];
    printf("enter n");
    scanf_s("%d",&n);
    printf("enter elements");
    for(i=0;i<n;i++)
    {
        scanf_s("%d",&x[i]);
    }

    for(i=0;i<n-1;i++)
    {
        for(j=0;j<n-1;j++)
        {
            if(x[j]>x[j+1])
            {
                k=x[j];
                x[j]=x[j+1];
                x[j+1]=k;
            }
        }
    }
    m = createindex(x,n,index);
    while(1)
    {
        printf("1.enter ele to search 2.exit");
        scanf_s("%d",&k);
        if(k==2)
        {
            break;
        }
        printf("enter ele to search");
        scanf_s("%d",&ele);
        if(indexsearch(x,n,index,m,ele)==1)
            printf("\n element found");
        else printf("\nelement not found");
    }
    _getch();
    return 0;
}