in c$++$ Assume an array of sorted integers with Students ID$.$ Write a program to insert few Student IDs in the array such that the array remains sorted. Assume an array sid $=\{1,3,6,8,10\}$ to start with. Solution:

Find out how many user ids need to be inserted Check if those Ids already existing. IF so don't insert them. Just print a message the element if found at the index position If not found, insert them in such a way that the arrays remain sorted #include

using namespace std;

int findId$($int$,$ int $[],$ int$)$;

void insertId$($int$,$ int $[],$ int$)$;

int main$()$

$\{$

const int MAX$\_$SIZE $=100$;

int sid$[$MAX$\_$SIZE$]=\{1,3,6,8,10\}$;

int index, id;

$//$ To insert more numbers

int num, size $=5$;

cout $<<$ "How many numbers do you want to insert? $"$;

cin $>>$ num;

cout $<<$ "Enter the student ids: $"$;

$/*$

Enter your code

$*/$

cout $<<$ "The array with all the elements inserted are: $"$;

$/*$

Enter your code

$*/$

$\}$

$//$ should return the index of val if it is present in the array

$//$ otherwise return $-1$

int findId$($int val, int arrId$[],$ int sz$)$

$\{$

$/*$

Enter your code

$*/$

$\}$

void insertId$($int val, int arrId$[],$ int sz$)$

$\{$

$/*$

Enter your code

$*/$

$\}$