Selection Sort

CS1

Authors

  • Donna Gavin University of Wisconsin - Platteville

Abstract

This activity is an insight into why sorting is so important in computer programming.  It starts with a search for items in the Periodic table, which is not sorted in any alphabetic way. This activity is meant to highlight why sorting is needed in the first place. Then it transitions to an introduction to sorting a list of numbers using selection sort.  The third activity introduces a partial pseudocode solution, and the last activity shows an incomplete python solution.

This activity was developed with NSF support through IUSE-1626765. You may request access to this activity via the following link: IntroCS-POGIL Activity Writing Program. 

  • Level: College undergraduate CS1
  • Setting: Computer lab
  • Activity type: Learning Cycle, POGIL lab
  • Discipline: Computer Science
  • Course: CS1
  • Keywords: sorting, selection sort, performance, linear search

Downloads

Published

2023-01-08

How to Cite

Gavin, D. (2023). Selection Sort: CS1. POGIL Activity Clearinghouse, 3(4). Retrieved from https://pac.pogil.org/index.php/pac/article/view/342

Issue

Vol. 3 No. 4 (2022): CS-POGIL Special Issue

Section

CS-POGIL Activity Writing Program

License

Copyright of this work and the permissions granted to users of the PAC are defined in the PAC Activity User License.