#include<stdio.h>
#include<stdlib.h>
int main() {
   int a[50], i, j, k, count = 0, dup[50], number, isDuplicate;
   printf("Enter size of the array\n");
   scanf("%d", &number);
   printf("Enter Elements of the array:\n");
   for(i = 0; i < number; i++) {
      scanf("%d", &a[i]);
      dup[i] = 0; // Initialize helper array
   }
   printf("Entered elements are: \n");
   for(i = 0; i < number; i++) {
      printf("%d ", a[i]);
   }
   for(i = 0; i < number; i++) {
      if(dup[i] == 0) { // Check if already marked as duplicate
         for(j = i + 1; j < number; j++) {
            if(a[i] == a[j]) {
               dup[j] = 1; // Mark as duplicate
            }
         }
      }
   }
   printf("\nAfter deleting the duplicate elements, the Array is:\n");
   for(i = 0; i < number; i++) {
      if(dup[i] == 0) { // Print non-duplicate elements
         printf("%d ", a[i]);
      }
   }
   return 0;
}

Algorithm of Binary Search

Binary Search is an efficient searching technique used to find an element in a sorted array by dividing the search interval into halves. This algorithm reduces the search space significantly with each step, making it faster than linear search. Here’s how it works:

1. Initial Step: Begin by selecting the middle element of the sorted array. Compare this middle element with the key value (the element you are searching for).

2. Comparison:

   • If the middle element matches the key, the search is successful, and the position of the element is returned.
   • If the key is greater than the middle element, focus on the right half of the array.
   • If the key is smaller than the middle element, focus on the left half of the array.

3. Repeat the Process: Continue dividing the array and comparing the key with the new middle element of the reduced sub-array.

4. Termination Condition: Repeat the process until the sub-array size reduces to 1. If the key is not found by then, the search is unsuccessful, and the algorithm returns “not found.”

Difference between active and passive attack