Is quicksort a stable algorithm?
Answer / Shashi Shankar
No, QuickSort is an unstable sorting algorithm. It does not preserve the relative order of equal elements.
| Is This Answer Correct ? | 0 Yes | 0 No |
Can we insert null in hashset?
Is vector a collection?
What is binary search in programming?
Is array immutable?
What is a directed graph?
How can I study data structures and algorithms?
Is a hashmap a dictionary?
How do you reference all the elements in a one-dimension array?
What is a static structure?
What do you understand by stable sort?
Define adjacent nodes?
What is meant by binary tree?