# Selection Sort KS3 Resources

## Teach KS3 Students About Selection Sort, Save Hours of Prep!

Do you want to save hours of lesson preparation time? Get your evenings and weekends back and focus your time where it's needed! Be fully prepared with presentations, notes, activities, and more.

All Computer Science topics are covered, and each module comes complete with:

• Classroom Presentations
• Revision Notes
• Activities & Quizzes
• Mind Maps, Flashcards & Glossaries

#### What is selection sort?

Selection sort is a simple sorting algorithm that repeatedly selects the smallest or largest element from an unsorted portion of the list and places it in the correct position in the sorted portion of the list.

#### How does selection sort work?

Selection sort repeatedly selects the smallest element from the unsorted portion of the list, and places it at the beginning of the sorted portion of the list. Then it selects the next smallest element, and so on, until the entire list is sorted.

#### What is the time complexity of selection sort?

The time complexity of selection sort is O(n^2) in the worst and average case, and O(n^2) in the best case.