-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprogram11_2.c
75 lines (56 loc) · 1.32 KB
/
program11_2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
// 2. Accept N numbers from user and accept one another number as NO ,
// return index of first occurrence of that NO
#include <stdio.h>
#include <stdlib.h>
int FirstOcc(int Arr[],int iLength,int iNo)
{
int iCnt = 0 , iIndex = 0;
for( iCnt = 0; iCnt < iLength; iCnt++)
{
if((Arr[iCnt] ) == iNo )
{
break;
}
}
if(iCnt == iLength)
{
return -1;
}
else
{
return iCnt;
}
}
int main()
{
int iSize = 0, iRet = 0, iCnt = 0;
int iValue = 0;
int *p = NULL;
printf("ENTER Number of Elements : ");
scanf("%d",&iSize);
printf("ENTER Number for Search : ");
scanf("%d",&iValue);
p = (int *)malloc(iSize * sizeof(int));
if (p == NULL)
{
printf("Unable to allocate memory !!!");
return -1;
}
printf("ENTER The %d Elements \n",iSize);
for ( iCnt = 0; iCnt < iSize; iCnt++)
{
printf("Enter %d Elements : \n",iCnt + 1);
scanf("%d",&p[iCnt]);
}
iRet = FirstOcc(p, iSize,iValue);
if(iRet == -1)
{
printf("There is no such number");
}
else
{
printf("First occurrence of number is %d",iRet);
}
free(p);
return 0;
}