using c++ .. Given an array of integers. Find the Inversion Count in the array.  Inversion Count: For an array, inversion count indicates how far (or close) the array is from  being sorted. If array is already sorted then the inversion count is 0. If an array is sorted in the  reverse order then the inversion count is the maximum.  Formally, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j. Examples: Input: N = 5, arr[] = {2, 4, 1, 3, 5} Output: 3 Explanation: The sequence 2, 4, 1, 3, 5  has three inversions (2, 1), (4, 1), (4, 3). Input: N = 5 arr[] = {2, 3, 4, 5, 6} Output: 0 Explanation: As the sequence is already  sorted so there is no inversion count. Input: N = 3, arr[] = {10, 10, 10} Output: 0 Explanation: As all the elements of array  are same, so there is no inversion count

3. Largest: a recursive function that computes the largest value for an integer array of positiveand negative values. For example, for the array below, the function largest should return 22,which is the largest value in the array. You can assume there are no more 20 integers in thearray. Think of how to formulate the recurrence relation in this problem yourself.

Task using C language Write a program that checks both of the following conditions hold for a given array a1, a2, …, an. If the conditions hold, display “yes”, otherwise, display “no”. a1 < a2 < … < an For every i from 2 to n, ai isn’t divisible by ai-1. Requirements Follow the format of the examples below. The program reads in the number of elements of the array, for example, 4, then read in the numbers in the array, for example, 3 6 8 9. In the main function, declare the input array after reading in the number of elements of the array, then read in the elements. Examples (your program must follow this format precisely) Example #1 Enter the length of the input array: 7Enter the array elements: 2 5 4 1 6 9 12Output: no Example #2 Enter the length of the input array: 6Enter the array elements: 2 7 13 19 23 43Output: yes

java - netbeans