Write a c++ program to declare an array of odd number of elements. Split it into the middle and store the elements in two different arrays. e.g. Initial array: 22 58 19 87 15 72 9 1 37 After splitting: 22 58 19 87 15 72 9 1 37     As output, your code should print the original and the two split arrays, each element separated by the comma sign. Your code should be generic enough to also work for arrays with an even number of elements.

Write a program that stores dynamically allocated array of Movie (using calloc() function). Movie is the Structure with seven fields: name, genre (science fiction – action – drama/love), ticketPrices, list of actors/actresses, ratings(number of tickets sold), cost of production and profit.   In program implementation user enters the following:   Movie Name Movie1 Movie2 Movie3   Genre   Science Fiction   Action   Drama-Love   List of Actors /Actresses         Ratings(number of tickets sold)   720   750   300   Ticket Prices   $45.3   $50.2   $2.3   Cost of production   $5000.5   $7000.1   $100   Net Profit         -   Print the Movie names, list of actors/actresses, ratings(number of tickets sold), ticket prices, cost of production and the total net profit of each movie(net_profit_of_movie)   - Write a function that calculates the net_profit_of_movie; which is the multiplication of ticket prices and…

You’re writing a function that accepts an array of unsorted integers and returns the length of the longest consecutive sequence among them. The sequence is formed by integers that increase by 1. For example, in the array: [10, 5, 12, 3, 55, 30, 4, 11, 2] the longest consecutive sequence is 2-3-4-5. These four integers form an increasing sequence because each integer is one greater than the previous one. While there’s also a sequence of 10-11-12, it’s only a sequence of three integers. In this case, the function should return 4, since that’s the length of the longest consecutive sequence that can be formed from this array. One more example: [19, 13, 15, 12, 18, 14, 17, 11] This array’s longest sequence is 11-12-13-14-15, so the function would return 5. Your job is to optimize the function so that it takes O(N) time.

Replace all the occurences of the digit 0 in the array with the digit 1 and replace all the occurences of the digit 1 in the array with the digit 0. Write the program in C++ and display the result matrix. {{1,0,0,1,0}, {1,1,1,0,0}, {0,0,0,1,0}, {1,0,1,0,1}, {0,0,1,0,0}}

You are designing a function that will manipulate an array of integers. It needs to work for arrays of any length. What is the minimum number of parameters your function will have?

In C++  please ! Write a Program that: Initializes an interger array size of 10 with random intergers in range [10,30]. Use a function named 'initialized_array' to acheive that. Determine if all array elements are distinct from each other or not.Use boolean function  named 'distinct_elements' to achieve that function 'distinct elements,  if the elements in the array are duplicate print out, elements are duplicate if not print out array

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below.             The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Processing Requirements - c++ Use the following template to start your project: #include<iostream> using namespace std;   // Global constants const int ROWS = 3;  // The number of rows in the array const int COLS = 3;  // The number of columns in the array const int MIN = 1;  // The value of the smallest number const int MAX = 9;  // The value of the largest number //…

Write answer in c++.