MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Insertion sort is a sorting algorithm in which the given array is divided into a sorted and an unsorted section. In each iteration, the element to be inserted has to find its optimal position in the sorted subsequence and is then inserted while shifting the remaining elements to the right.

Detailed explanation-2: -Ans. Yes, Insertion sort is both an inplace and a stable algorithm. Insertion sort is a stable algorithm since equal elements remain the same in the sorted array as that of the unsorted array. It is also an inplace algorithm as only a constant number of extra variables is used to store the current element.

Detailed explanation-3: -Insertion sort is a sorting algorithm that places an unsorted element at its suitable place in each iteration.

Detailed explanation-4: -The Insertion Sort Algorithm in Python. Like bubble sort, the insertion sort algorithm is straightforward to implement and understand. But unlike bubble sort, it builds the sorted list one element at a time by comparing each item with the rest of the list and inserting it into its correct position.

Detailed explanation-5: -Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.