Sample Video Frame

Created by Zed A. Shaw Updated 2024-02-17 04:54:36

Exercise 35: Sorting and Searching

In this exercise, I'm going to cover four sorting algorithms and one search algorithm. The sorting algorithms are going to be quick sort, heap sort, merge sort, and radix sort. I'm then going to show you how do a to binary search after you've done a radix sort.

However, I'm a lazy guy, and in most standard C, libraries you have existing implementations of the heapsort, quicksort, and merge sort algorithms. Here's how you use them:

Previous Lesson Next Lesson

Register for Learn C the Hard Way

Register today for the course and get the all currently available videos and lessons, plus all future modules for no extra charge.