34 lines
929 B
C
34 lines
929 B
C
|
/*
|
||
|
|
* C Program to Find if a given Integer X appears more than N/2 times in a Sorted Array of N Integers
|
||
|
|
*/
|
||
|
|
# include <stdio.h>
|
||
|
|
# define bool int
|
||
|
|
|
||
|
|
bool Morenooftimes(int array[], int n, int x)
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
int final_index = n % 2 ? n / 2 : (n / 2 + 1);
|
||
|
|
for (i = 0; i < final_index; i++)
|
||
|
|
{
|
||
|
|
/* check if x is presents more than n/2 times */
|
||
|
|
if (array[i] == x && array[i + n / 2] == x)
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int array[] = {10, 15, 15, 12, 17,15};
|
||
|
|
int n = sizeof(array) / sizeof(array[0]);
|
||
|
|
int x = 15;
|
||
|
|
if (Morenooftimes(array, n, x))
|
||
|
|
printf("The given no %d appears more than %d times in array[]", x, n/2);
|
||
|
|
else
|
||
|
|
printf("The given no %d does not appear more than %d times in array[]", x, n/2);
|
||
|
|
getchar();
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
The given no 15 appears more than 3 times in array[]
|