in c programming

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
icon
Related questions
Question

in c programming

 

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 al=(2,3,2.22,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.
Input
Result
8 2 3 222 3 2 2 appears more than i times in the array.
1
8 2 3 3 22 3 2 No value appears more than 4 times in the
1
array.
Transcribed Image Text: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 al=(2,3,2.22,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. Input Result 8 2 3 222 3 2 2 appears more than i times in the array. 1 8 2 3 3 22 3 2 No value appears more than 4 times in the 1 array.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning