|
CSTA K-12 Repository >
CSTA Source: K-12 Repository >
Level 1: Foundations of Computer Science >
L1 A 08: Computer Programming >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2378/337
|
| Title: | First Day Activity - Sorting |
| Authors: | Franke, Baker |
| Keywords: | sorting
activity
unplugged
first day
introduction |
| Issue Date: | 22-Aug-2008 |
| Series/Report no.: | created 2006 |
| Abstract: | This is an activityfor grades 6-12 that gets students to think about the problem of sorting some playing cards. The rules of the "game" essentially abstract the "rules" for the comparison-based sorting in a computer.
It seems to work well to get kids into the CS mindset, and builds some confidence that they can succeed.
It has the nice side effect of teaching the O(n^2) sorting algorithms and a little big-oh analysis (if you choose to do so) all on the first day! |
| Description: | DISCLAIMER: The activity sheet is really quite sketchy. It'll give you the gist of what I do, but it is by no means a neat little package. You should add your own flavor and passion to it. In other words, don't try this without prepping it! |
| URI: | http://hdl.handle.net/2378/337 |
| Appears in Collections: | L1 A 08: Computer Programming
L4 A 05: Standard Algorithms [AP Topic Outline V]
L3 A 01: Program design & problem solving
L2 A 02: Algorithmic Problem Solving
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| Activity_cardSorting.pdf | | 53Kb | Adobe PDF | View/Open |
|
| 
