Sorting Algorithms Quiz

False (B)

<p>O(n)</p> Signup and view all the answers

A sorting algorithm that progressively builds a sorted array from smaller subarrays.

A subarray within the main array used in Insertion Sort, consisting of elements that are already sorted.

A subarray within the main array used in Insertion Sort, consisting of elements that are still unsorted.

The element being considered during each iteration of Insertion Sort, which needs to be placed in its appropriate position within the sorted subarray.

The process of positioning the 'New Item' at the correct index in the sorted subarray during Insertion Sort.

The index within the sorted subarray where the 'New Item' should be placed.

Comparing the 'New Item' to elements in the sorted subarray, starting from the end, to find the appropriate 'Insert Position'.

The index of the element in the sorted subarray being compared to the 'New Item' during Insertion Sort.

The operation of moving elements in the sorted subarray to the right to create space for the 'New Item' when inserting.

The process of assigning the value of the 'New Item' to the correct index in the sorted subarray.

The process of iterating through the unsorted subarray in Insertion Sort, picking each 'New Item' and inserting it into the sorted subarray.

The initial state of the sorted subarray in Insertion Sort, containing only one element (the first element of the array).

The state of the sorted subarray after each iteration of the Insertion Sort algorithm.

The final state of the sorted subarray after all elements from the unsorted subarray have been inserted, resulting in the entire array being sorted.

An algorithm that uses a single loop to iterate through the array and insert elements one by one into their correct positions, maintaining a sorted subarray while gradually expanding it to encompass the entire array.

The act of comparing the 'New Item' with elements in the sorted subarray during Insertion Sort.

The condition that determines whether the 'New Item' should be inserted at the current 'Comparison Index' or the comparison should continue with the next index.

The action of moving an element in the sorted subarray to the right to make space for the 'New Item' during Insertion Sort.

The operation of comparing the 'New Item' with the element at the 'Comparison Index' in the sorted subarray.

The condition where the comparison between the 'New Item' and the element at the current 'Comparison Index' in the sorted subarray determines that the 'New Item' should be inserted at the current index.

The condition where the comparison between the 'New Item' and the element at the current 'Comparison Index' in the sorted subarray determines that the comparison should continue with the next index.

The process of finding the correct position for the 'New Item' by comparing it with elements in the sorted subarray.

The act of placing the 'New Item' at its correct position within the sorted subarray, based on the comparison results.

The process of repeating the insertion process for each element in the unsorted subarray.

The state of the sorted subarray after the 'New Item' has been placed in its correct position.

The process of choosing the next 'New Item' from the unsorted subarray in Insertion Sort.

The state where all elements in the unsorted subarray have been inserted into their correct positions in the sorted subarray.

The final sorted array, containing all elements in their correct ascending order.