Describe an algorithm based on the linear search for determining the correct position in which to insert a new clement in an already sorted list.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.