Which of the following is correct with regard to insertion sort?
A. insertion sort is stable and it sorts In-place
B. insertion sort is unstable and it sorts In-place
C. insertion sort is stable and it does not sort In-place
D. insertion sort is unstable and it does not sort In-place
Answer: Option A
This Question Belongs to Data Structure >> Sorting Algorithms
Related Questions on Sorting Algorithms
What is the time complexity of Bubble Sort in the average case?
A. O(n log n)
B. O(n)
C. O(n2)
D. O(n3)
Which sorting algorithm is based on the divide-and-conquer strategy?
A. Insertion Sort
B. Quick Sort
C. Selection Sort
D. Insertion Sort
Which sorting algorithm uses a "pivot" element to partition the array into sub-arrays?
A. Merge Sort
B. Heap Sort
C. Counting Sort
D. Quick Sort
Join The Discussion