Question

Describe an algorithm based on the linear search for determining the correct position in which to insert a new element in an already sorted list

Short answer

Not given

Step-by-step solution

Step 1

Set i=1;

while i≤n and x>arr[i];

i→i+1

if x is less than arr[i];

loc=i;

else

loc= n+1

return loc

Final answer                                                                                                                        

The algorithm based on linear search is,

Set i=1;

while i≤n and x>arr[i];

i→i+1

if x is less than arr[i];

loc=i;

else

loc= n+1

return loc