Story Programming

Module: Searching & Sorting

Overview

This teaching module explains two fundamental example problems for which algorithms and related computer science principles are used: searching and sorting. Specifically, it covers the following questions and topics.

  • What is a binary search?
  • What is a binary tree?
  • What is divide and conquer?
  • Different sorting algorithms

Prerequisites

Contained in this Module