Write a program in C language that will introduce N integers in a one-dimensional N-Array (N = known) and will rank it in ascending order of its data.
An integer A is then inserted and:
- if the number A is present in the array, its position will be located, with the least possible effort (binary search).
- If the number is found more than one times, only the first encountered location will be displayed.
- if the number A is not present in the array is inserted into it in the appropriate position so that the array will still be sorted.