Write a program to find the value in an integer array all of length N that occurs at least (N/2 + 1) times, if such a value exists. So, if all-(2,3,2,2,2,3,2,1} then the program should output 2, since 2 occurs 5>N/2 times. For example, if all - (2,3,2,2,2,3,2,1} the program should write out 2 appears more than 4 times in the array. if al] = (2,3,3,2,2,3,2,1} the program should write out No value appears more than 4 times in the array.

Write a program to find the value in an integer array all of length N that occurs at least (N/2 + 1) times, if such a value exists. So, if all-(2,3,2,2,2,3,2,1} then the program should output 2, since 2 occurs 5>N/2 times. For example, if all - (2,3,2,2,2,3,2,1} the program should write out 2 appears more than 4 times in the array. if al] = (2,3,3,2,2,3,2,1} the program should write out No value appears more than 4 times in the array.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write a program to input a list of numbers in an array and then rearrange this array in such a waythat all the odd numbers appear in the beginning of the array and all the even numbers appear in theend of the array. E.g., if the input list is 1,4,2,7,6,5,9, then after rearrangement the list should be:1,7,5,9,4,2,6.
Write a program that reads from the user an array with one dimension n and then find the largest even and smallest negative element numbers.
Write a program that prompts the user to enter an integerm and find the smallest integer n such that m * n is a perfect square. (Hint:Store all smallest factors of m into an array list. n is the product of the factors thatappear an odd number of times in the array list. For example, consider m = 90,store the factors 2, 3, 3, and 5 in an array list. 2 and 5 appear an odd number oftimes in the array list. Thus, n is 10.) Here are some sample run: Enter an integer m: 1500 ↵EnterThe smallest number n for m * n to be a perfect square is 15m * n is 22500
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
Write a program to take input of 100 integers in a dynamically allocated array using malloc() function, then find the average of numbers that are in between 20 and 80. For example if an array contains [10, 40, 15, 20, 30, 90] then the average will be (40+20+30) / 3 = 30.
Write a program that reads an integer array a[] from the console and writes out the subsequence of the array that sums to the largest value. If there are more than one such subsequence, then the program should write out the subsequence that starts at the smallest position in the array and, if there are more than one subsequence of largest sum starting at the same smallest position, it should write out the shortest such subsequence.
Write a program that reads integers between 1 and 100 and countsthe occurrence of each number. Assume the input ends with 0 and that the maximum capacityof the array is 100
Write a Java program to find continuous sub array of the given array whose sum is equal to a given number. For example, If {12, 5, 31, 9, 21, 8} is the given array and 45 is the given number, then you have to find continuous sub array in this array such that whose elements add up to 45. In this case, {5, 31, 9} is such sub array whose elements add up to 45.
Write a python program to print the prime numbers existing in an array. For instance, if A = [4, 7, 12, 3, 9], the output should be 7, 3.
Write a C program that reads in an array of integers of size n (n <= 100) from the user and prints out the largest subarray of consecutive integers in the array. For example, if the user enters the array [3, 4, 5, 1, 2, 3, 6, 7], the program should output "Largest subarray of consecutive integers: [3, 4, 5]".
Write an c progra, that takes an array of N integers (N will be specified by the user at run time). It then finds how many numbers in the array are divisible by 3 and how many numbers are divisible by 7. the it copies, from the input array above, the numbers that are divisible by 3 into a new array and those divisible by 7 into a different new array. Once copied, the algorithm should compute the average of each of these two new arrays and print the averages on the screen with suitable message to let the user know which average is being printed Note: an integer number is divisible by 3 (respectively 7) if the remaining of its division by 3 (respectively 7) is 0. You are allowed to use the modulus operator %.
Write a program that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: no