Write a Menu Driven C++ program that creates one-dimensional array arr[] and initialize it with user. The program should do following Tasks using Menu, the menu operations are implemented using functions: a) Write a function Count(), that counts the occurrences of x (a number) in arr[]. b) Write a function Partition(), that take the first element of the array x and put x in a position such that all smaller elements (smaller than x) are before x, and put all greater elements (greater than x) after x. c) Write a function next_XOR(),the count of elements which are equal to the XOR of the next two elements. d) Write a function Duplicates(),which calculated the frequencies of all the elements and display them. e) Write a function Circular(),which replace every element of the array by the sum of next two consecutive elements in a circular manner i.e. arr[0] = arr[1] + arr[2], arr[1] = arr[2] + arr[3], ... arr[n – 1] = arr[0] + arr[1]. f) Write a function Search(), takes an array and element to search in the array and returns the index of element if the element is found. And return the negative number if not found. g) Write a function shift_Circular (), which shifts an array circularly left by two positions. Thus, if p[0] = 15, p[1]= 30, p[2] = 28, p[3]= 19 and p[4] = 61 then after the shift p[0] = 28, p[1] = 19, p[2]= 61, p[3] = 15 and p[4] = 30.
Please Help me with This Problem
Language = C++
Write a Menu Driven C++ program that creates one-dimensional array arr[] and initialize it with user. The
program should do following Tasks using Menu, the menu operations are implemented using functions:
a) Write a function Count(), that counts the occurrences of x (a number) in arr[].
b) Write a function Partition(), that take the first element of the array x and put x in a position such
that all smaller elements (smaller than x) are before x, and put all greater elements (greater
than x) after x.
c) Write a function next_XOR(),the count of elements which are equal to the XOR of the next two
elements.
d) Write a function Duplicates(),which calculated the frequencies of all the elements and display
them.
e) Write a function Circular(),which replace every element of the array by the sum of next two
consecutive elements in a circular manner i.e. arr[0] = arr[1] + arr[2], arr[1] = arr[2] + arr[3],
... arr[n – 1] = arr[0] + arr[1].
f) Write a function Search(), takes an array and element to search in the array and returns the
index of element if the element is found. And return the negative number if not found.
g) Write a function shift_Circular (), which shifts an array circularly left by two positions. Thus, if
p[0] = 15, p[1]= 30, p[2] = 28, p[3]= 19 and p[4] = 61 then after the shift p[0] = 28, p[1] = 19, p[2]= 61, p[3] = 15 and p[4] = 30.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
