Virtual Labs

What is the main characteristic of Selection Sort?

It divides the array into subarrays
It selects and places the smallest element in each pass
It uses recursion for sorting
It swaps all elements in each iteration

What is the time complexity of Selection Sort in the best case?

O(n)
O(n²)
O(log n)
O(n log n)

What happens during one pass of Selection Sort?

All elements are swapped
The smallest element is placed in its correct position
The largest element is placed in its correct position
No changes are made

Which of the following is true about Selection Sort?

It is a stable sorting algorithm
It is an unstable sorting algorithm
It requires additional memory
It works best on large datasets

What is the space complexity of Selection Sort?

O(n)
O(n²)
O(1)
O(log n)

Virtual Labs

Selection Sort

Answer the multiple-choice questions below to test your understanding!

Multiple-Choice Questions:

Virtual Labs

Selection Sort

Answer the multiple-choice questions below to test your understanding!

Multiple-Choice Questions:

Rate

Bug Report