TPT
Total:
$0.00
AP Computer Science A - Sorting Algorithms
AP Computer Science A - Sorting Algorithms
AP Computer Science A - Sorting Algorithms
AP Computer Science A - Sorting Algorithms
AP Computer Science A - Sorting Algorithms
AP Computer Science A - Sorting Algorithms
AP Computer Science A - Sorting Algorithms
AP Computer Science A - Sorting Algorithms
Share

Description

Several activities that can be used to walk students through the 3 sorting algorithms covered on the AP exam - Selection Sort, Insertion Sort, and Merge Sort.

Includes:

  • Explanation, visualization, and discussion questions related to each sorting algorithm that students can include in their notes
  • Cumulative activity in which students compare the three sorting algorithms they have learned about, solidifying their understanding of which algorithm is more efficient in different situations
  • Supplemental Quick Sort material for students that need an additional challenge
  • Two versions of a short assessment with questions similar to those students can expect to see on the AP exam

Make sure your students are ready to handle sorting questions on the AP Computer Science A exam this spring!

Report this resource to TPT
Reported resources will be reviewed by our team. Report this resource to let us know if this resource violates TPT's content guidelines.

AP Computer Science A - Sorting Algorithms

Rated 5 out of 5, based on 1 reviews
5.0 (1 rating)
Ms Ellie Tech
635 Followers
$3.00

Highlights

Digital downloads
Grades icon
Grades
9th - 12th
Pages
40
Answer Key
Included
Teaching Duration
4 days

Save even more with bundles

Looking for some new resources to use with AP Computer Science A students this year? Don't have enough time to come up with Java sample code for students to practice analyzing? This bundle is for you! Included are a number of 4-5 day packets that you can use in your classroom over the course of a we
Price $10.00Original Price $12.00Save $2.00
4

Description

Several activities that can be used to walk students through the 3 sorting algorithms covered on the AP exam - Selection Sort, Insertion Sort, and Merge Sort.

Includes:

  • Explanation, visualization, and discussion questions related to each sorting algorithm that students can include in their notes
  • Cumulative activity in which students compare the three sorting algorithms they have learned about, solidifying their understanding of which algorithm is more efficient in different situations
  • Supplemental Quick Sort material for students that need an additional challenge
  • Two versions of a short assessment with questions similar to those students can expect to see on the AP exam

Make sure your students are ready to handle sorting questions on the AP Computer Science A exam this spring!

Report this resource to TPT
Reported resources will be reviewed by our team. Report this resource to let us know if this resource violates TPT's content guidelines.

Reviews

5.0
Rated 5 out of 5, based on 1 reviews
1
rating
All verified TPT purchases
Rated 5 out of 5
February 7, 2022
First time teaching this topic. This was so helpful in not only helping me understand, but also my students.
Teresa Rex
(TPT Seller)
35 reviews
Grades taught: 11th

Questions & Answers

Loading
Loading