Question

Given a sorted array of integers created on the heap, its size and a new integer, design a function which will enlarge the array and place the new item in the appropriate position in the array, so that it remains sorted. c++

Answer 1

Using the computational language in C++ to write a code that will organize the values ​​in an array through a mathematical condition.

writing code in C++

#include <bits/stdc++.h>

using namespace std;

int getIndexInSortedArray(int arr[], int n, int idx)

{

/* Count of elements smaller than current

element plus the equal element occurring

before given index*/

int result = 0;

for (int i = 0; i < n; i++) {

if (arr[i] < arr[idx])

result++;

if (arr[i] == arr[idx] && i < idx)

result++;

}

return result;

}

int main()

{

int arr[] = { 3, 4, 3, 5, 2, 3, 4, 3, 1, 5 };

int n = sizeof(arr) / sizeof(arr[0]);

int idxOfEle = 5;

cout << getIndexInSortedArray(arr, n, idxOfEle);

return 0;

}

See more about C++ at brainly.com/question/12975450

#SPJ1