- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Statement 1: Shell sort is a stable sort...

Q. |
## Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm. |

A. | Both statements are true |

B. | Statement 2 is true but statement 1 is false |

C. | Statement 2 is false but statement 1 is true |

D. | none |

Answer» B. Statement 2 is true but statement 1 is false |

View all MCQs in:
Data Structures (DS)

- Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
- Which of the following sorting algorithm is stable?
- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
- Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
- What is the advantage of selection sort over other sorting techniques?
- What is an external sorting algorithm?
- What is an internal sorting algorithm?
- What is an in-place sorting algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ