Reference no: EM132320230

Merge sort the array and check prime numbers

A program which will sort an array of integers in an ascending order using merge sort,

and indicate whether each int element is prime.

No memory leaks are allowed.

Steps:

• A one-dimensional dynamic array of integers which is randomly populated with values between 1 and 50.
• Establish the length of the array based on user input.
• Error handle this value to make sure it is a valid number greater than or equal to zero and no larger than 20.
• Print the elements of the array.
• A copy of the array and use merge sort to sort it in an ascending order.
• Print the elements of the sorted array.
• Print out all prime numbers of the array.
• End the program and make sure all memory has been freed.