In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array ... We will go through the quicksort and quickselect algorithms for sorting ...

We have seen examples of divide and conquer algorithms in previous courses, such as mergesort and quicksort algorithms. We will study more algorithms that fit this design paradigm. We will study Fast ...

I tested it out by asking it to implement a QuickSort algorithm as a C++ function with integer inputs, a task that has stymied many earlier models, and to write a test suite for the function.