Saran wants to develop a program that uses linear search to find the majority element in an array, which is an element appearing more than n-2 times, where n is the size of the array. The program should input the size of the array and its elements. Display the majority element if found, and indicate if no majority element is present in the array.Help Saran in developing the program.Input format :The first line of input consists of an integer n, representing the number of elements in the array.The second line consists of n space-separated integers, representing the array elements.Output format :The output prints an integer representing the majority element.If no such element is found, print "No majority element found."Refer to the sample output for formatting specifications.Code constraints :1 ≤ n ≤ 101 ≤ array elements ≤ 100Sample test cases :Input 1 :51 4 1 1 1Output 1 :1Input 2 :

Given an array nums of size n, return the majority element.The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example 1:Input: nums = [3,2,3]Output: 3Example 2:Input: nums = [2,2,1,1,1,2,2]Output: 2 Constraints:n == nums.length1 <= n <= 5 * 104-109 <= nums[i] <= 109 Follow-up: Could you solve the problem in linear time and in O(1) space?

Problem StatementArun is given an array of integers where all elements appear twice, except for one element that appears only once. The goal is to find this single, non-duplicate element using a linear search algorithm. If the element is not found, print the appropriate message.Assist Arun in solving this challenge.Input format :The first line of input consists of an integer N, representing the number of elements in the array.The second line consists of N space-separated integers, representing the array elements.Output format :The output prints an integer, representing the single non-duplicate element in the given array.If no such element is found, print "No non-duplicate element found".Refer to the sample output for formatting specifications.Code constraints :1 ≤ N ≤ 151 ≤ elements of the array ≤ 30Sample test cases :Input 1 :91 1 2 3 3 4 4 8 8Output 1 :2Input 2 :712 16 12 15 17 16 15Output 2 :17Input 3 :414 26 14 26Output 3 :No non-duplicate element found

Alex wants to create a program to search a target value in a sorted array. The program should input the array size and elements, as well as the target value. Utilizing binary search, it should determine if the target is present, and if so, provide the index. If not, display a message indicating its absence.Assist Alex in completing the program efficiently.Input format :The first line of input consists of an integer N, representing the size of the sorted array.The second line consists of N space-separated integers, the elements of the sorted array in ascending order.The third line consists of an integer target, the value to search for in the array.Output format :If the target is present in the array, print "The target value X is present at index Y", where X is the target element and Y is the index position (index starts from 0).If the target is not present, print "The target value X is not present in the array", where X is the target element.

Given an array nums of size n, return the majority element.The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Sharon is working on a sorted array of integers and wants to determine the count of elements that are less than or equal to a specific key. As her supportive programmer, you are tasked with creating a program to assist Sharon in counting the number of elements that meet this criterion (less than or equal to the given key) using the binary search technique.Input format :The first line of input consists of an integer N, representing the size of the array.The second line consists of N space-separated integers, the elements of the array.The third line consists of an integer key, the value to search for in the array.Output format :The output prints a single integer, representing the count of elements that are less than or equal to the given key.