Selection sort is not suitable for _______ datasets as it performs a fixed number of comparisons and swaps.
- Large
- Randomized
- Small
- Sorted
Selection sort is not suitable for large datasets as it performs a fixed number of comparisons and swaps. Regardless of the input, it always performs the same number of operations, making it inefficient for large datasets.
Loading...
Related Quiz
- Which algorithmic approach is commonly used to solve the Longest Increasing Subsequence problem efficiently?
- One of the key advantages of merge sort is its _______ time complexity in all cases.
- An array is a _______ structure that stores a collection of _______ elements.
- How does merge sort perform in terms of time complexity compared to other sorting algorithms for large datasets?
- It ensures finding the shortest path by maintaining a _______ that contains the shortest distance to each node from the source.