#include <stdio.h>
int prime(int arr[], int size) {
int i, j;
for(i=0; i<size; i++) {
for(j=i+1; j<size; j++) {
if(arr[i] == arr[j])
return 1; // has duplicate
}
}
return 0; // no duplicate
}
int linear(int arr[], int size, int x) {
int i;
for(i=0; i<size; i++) {
if(arr[i] == x)
return 1;
}
return 0; // not found
}
int main() {
int arr[50], n, i,k;
printf("Number of integers: \n");
scanf("%d", &n);
printf("Enter %d integers: \n", n);
for(i=0; i<n; i++)
scanf("%d", &arr[i]);
if(prime(arr, n))
printf("Array contains duplicates\n");
else
printf("Array does not contains duplicates\n");
printf("Enter number to search: ");
scanf("%d", &k);
if(linear(arr, n, k)){
printf("%d is in array\n", k);
}else{
printf("%d is not in array\n", k);
}
}
