Virtual Labs

What does Selection Sort primarily do?

Divides the array into smaller parts
Selects the smallest element and places it in its correct position
Inserts elements into their correct position
Sorts elements using recursion

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

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

What happens during one iteration 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 a disadvantage of Selection Sort?

It is complex to implement
It requires additional memory space
It is not efficient for large datasets
It is unstable

What is the space complexity of Selection Sort?

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

Virtual Labs

Selection Sort Pretest

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

Multiple-Choice Questions:

Virtual Labs

Selection Sort Pretest

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

Multiple-Choice Questions:

Rate

Bug Report