Define a function void insertionSort(int nums[], int length) that uses the inser

Question

Define a function

void insertionSort(int nums[], int length)

that uses the insertion sort algorithm. That means insert the value nums[i+1] in the correct position of previously sorted elements nums[0] ... nums[i]. Start with i = 0 and continue until i = length - 1. During each pass, shift elements to the right until the correct insertion point is found. Be careful to save nums[i+1] to a temporary variable before shifting, otherwise you will lose its value during the first shift: nums[i+1] = nums[i].

Explanation / Answer

A function is a block of code that executes only when you tell it to execute. It can be when an event occurs, like when a user clicks a button, or from a call within your script, or from a call within another function. Functions can be placed both in the and in the section of a document, just make sure that the function exists, when the call is made. In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output. More formally, the output must satisfy two conditions: The output is in nondecreasing order (each element is no smaller than the previous element according to the desired total order); The output is a permutation (reordering) of the input.

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.