/*This program uses linear search to find givven number from the givven array
written by Sadi Evren SEKER*/

#include <stdio.h>

#define m 10     /*--- m is a constant and can be changed for different problems---*/

int search(int i);  /*--- decleration of my searc function ---*/

int a[m]={3,4,1,2,54,23,12,-43,13,45};  /*--- initial array for search function it can be 
					changed for other problems ---*/

void main()
{
	int i;
	printf("You can search one of the following numbers , is seperator\n\n");
	for (i=0;i<m;i++)     /*--- outputs the options can be entered ---*/
		printf("%d,",a[i]);
	printf("\n\nEnter your choice please \n\n --------->");    /*--- inputs shoise ---*/
	scanf("%d",&i);
	if (search(i)==0)			/*--- if not found print error 404 is code 
						from html browsers ---*/

		printf("\n\nError 404 object not found\n");
	else					/*--- if found print the order of number ---*/
		printf("\n\nYour number is found at %d. order\n",search(i));
}

int search(int i)

/*--- this function gets an integer and uses linear search on it to find on 
initial array and turns its order as integer ---*/
{
	int j;
	for(j=0;j<m;j++)  /*--- start search from 0 to m ---*/
	{
		if (a[j]==i)  /*--- if you can find return the order by increasing one
				becouse array starts from 0 ---*/
			return j+1;
	}
	return 0;		/*--- if you cannot find return 0 ---*/
}