Which of the following sorting algorithms is categorized as NON-comparison based?
Merge Sort
Quick Sort
Insertion Sort
Radix Sort
What is the worst-case time complexity of Selection Sort?
O(n)
O(n^2)
O(log n)
O(n log n)
Is Bubble Sort a stable sorting algorithm?
Yes
Stability is irrelevant for Bubble Sort
Only in its optimized version
No
Which of the following sorting algorithms has the best-case time complexity of O(n)?
Selection Sort
Bubble Sort
Both Bubble Sort and Selection Sort
Neither Bubble Sort nor Selection Sort
What is the primary operation used in Insertion Sort to place an element in its correct position?
Comparison
Swapping
Merging
Shifting
Sorting algorithms can be broadly classified into two categories. What are they?
In-place and Out-of-place
Stable and Unstable
Recursive and Iterative
Comparison-based and Non-comparison-based
What is the best-case time complexity of Insertion Sort?
O(1)
Which statement BEST describes the significance of understanding sorting algorithms?
All sorting algorithms perform equally well, so understanding them is unnecessary.
It's primarily a theoretical concept with little practical relevance.
It's only essential for software engineers specializing in algorithm development.
It enables developers to choose the most suitable algorithm for a given task based on efficiency and data characteristics.
What does it mean for a sorting algorithm to be 'in-place'?
It can sort data of any type, including numbers, text, and images.
It is the fastest possible sorting algorithm for a given data set.
It sorts the data in its original location without moving elements.
It sorts the data without requiring significant additional storage space.
Which of the following is a real-world application of sorting in databases?
Data compression for efficient storage.
Query optimization for faster retrieval of results.
Data encryption for enhanced security.
Natural language processing for text analysis.