Consider the pseudocode for insertion sort. Here, the next element in the unsorted portion of the list is swapped to the left until we find its appropriate location in the sorted part of the list. Describe another approach for determining where the next element belongs in the sorted portion of the list. In the context of sorting a vector in C++, does this affect the overall asymptotic run time of insertion sort? Why or why not?
Consider the pseudocode for insertion sort.
Here, the next element in the unsorted portion of the list is swapped to the left until we find its appropriate location in the sorted part of the list. Describe another approach for determining where the next element belongs in the sorted portion of the list. In the context of sorting a
![function insertionSort (L)
i = 1
while i < length(L)
j = i
while j > 0 and L[j] < L[j-1]
temp
L[j-1] = L[j]
L[j]
j = j
i = i + 1
L[j-1]
temp
1
-
return L](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1c981c52-3980-4b1a-9da7-fcf9e8d90feb%2F3d1fc520-71e5-4d63-9c55-84e323d18260%2Fl0s1unf_processed.png&w=3840&q=75)
Insertion Sort:
Insertion sort iterates through the input list, eating one element each time, and producing a sorted output list.
Insertion sort takes one element first from input data at a time, finds where it belongs inside the sorted list, & inserts it there.
It keeps going until there are no more input elements.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
