I have an array that is already sorted. Periodically, some new data comes in and is added to the array at random indexes, messing up the ordering. I need to re-sort the array to get it back to being fully ordered. I do not want to use very much additional memory during the sort. Choose the sorting algorithm we studied that will perform the best: a. Quick sort
b. Merge sort
c. Insertion sort
d. Selection sort

The answer is "Option C".

Explanation:

The array was already sorted. Much new information is applied to the array on a recurring basis at random indices, to bring everything back in order. During in the sort, I wouldn't want to use much further memory.

It is a sorting algorithm that constructs one piece at a time in the final sorted array. In large lists, it is far less effective than sophisticated technology like quicksort, heapsort, or combination sort.

i don't know to be honest but you on your own

step-by-step explanation:

ignitia made me retarted fool im stoopid laugh like shi

explanation:

i don't know to be honest but you on your own

step-by-step explanation:

ignitia made me retarted fool im stoopid laugh like shi

professionals can use many types of technology that can them. some examples are, computers (they research and can use for programs for data, they are also used for job applications, school work, and even to make new ideas), speedometers (can get data for unknown data), sometimes something as small as a pen (used for rough drafts, to insert data, and again job applications).