Which of the following is correct with regard to insertion sort...

Home / Data Structure / Sorting Algorithms / Question

Examveda

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

A. O(n log n)

B. O(n)

C. O(n²)

D. O(n³)

View Answer

A. Insertion Sort

B. Quick Sort

C. Selection Sort

D. Insertion Sort

View Answer

A. O(n²)

B. O(1)

C. O(n)

D. O(log n)

View Answer

A. Merge Sort

B. Heap Sort

C. Counting Sort

D. Quick Sort

View Answer