Please enable JavaScript to use CodeHS

IB Computer Science Higher Level (Year One)

View Syllabus Overview

Lesson 15.3 Recursive Sorting

Description

In this lesson, students will use recursive methods to sort an array called Merge Sort. Merge sort is a recursive sorting algorithm that can be used to sort elements in an array or ArrayList. This lesson corresponds with AP Computer Science A topic 10.3.

Objective

Students will be able to:

  • Apply recursive algorithms to sort elements of an array or ArrayList objects

Activities

These are all the activities included in the lesson

15.3.1 Recursive Sorting
15.3.2 Quiz: Recursive Sorting
15.3.3 Merge Sort
15.3.4 Sort Visualizer
15.3.5 Explore Merge Sort
15.3.6 Merge Sort Benchmark Testing
15.3.7 Recursive Calls
15.3.8 Sort Benchmark Testing
15.3.9 Using Concurrent Processes