Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
Commerce
- Commerce
- Class 11 Accountancy Notes
- Class 12 Accountancy Notes
- Accountancy
- Class 11 Business Studies Notes
- Class 12 Business Studies Notes
- Business Studies
- Class 11 Microeconomics Notes
- Class 11 Statistics For Economics Notes
- Class 12 Macroeconomics Notes
- Class 12 Indian Economic Development Notes
- Economics
- Management
- Income Tax
- Finance
GATE | Quiz for Sudo GATE 2021 | Question 12
Which of the following option is correct considering normal implementations of sorting algorithms?
Note - This question is multiple select questions (MSQ).
(A)
Merge Sort, Insertion Sort, and Bubble sort are type of stable sorting algorithms.
(B)
Quick Sort, Heap Sort, Selection sort are type of non-stable sorting algorithms.
(C)
When the array is sorted, insertion and bubble sort gives complexity of n but quick sort gives complexity of n^2.
(D)
When order of input is not known, merge sort is preferred as it has worst case time complexity of nlogn and it is NOT stable as well.
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!
Last Updated :
Share your thoughts in the comments
GeeksforGeeks