I need help programming this problem in C++   Given an array of N elements, what is the average number of comparisons a linear search function will make to locate a specific value?

Write a function in c programming language  that gets an array of points ( function is defined as : typedef struct{    int x;    Int y;   } point;   )  and sorts the array using qsort().Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1)  if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2)  if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)1⁄2 is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: -  Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] -  Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation:(1,1) is first because 12+12=2 is the smallest(3,2)…

Write some C++ code to sort an array of predefined data types using a template function.

Write a function in c called recursively_reverse_string() that accepts a pointer to a string as a parameter, and any other parameters you see fit, recursively reverses the string, and returns a pointer to the reversed string. For example, the reversed string of input “string” is “gnirts”.

Write a program which has a class called Character and data member which is a pointer to a character. Use appropriate data members to get input from the user and to perform linear search to locate an element in array pls code in c++