This sorting algorithm begins by sorting the initial portion of the array consisting of two elements. Then, the third element is moved to its correct position, relative to the first two elements. At that point, the first three elements are in sorted order. This process continues with the fourth and subsequent elements until the entire array is sorted.
a. bubble sort
b. selection sort
c. insertion sort
d. Quicksort
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.