Welcome! Log In Create A New Profile


Comprehensive notes on recursion, searching, and sorting algorithms

Posted by Bronwen 
Announcements Last Post
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
Comprehensive notes on recursion, searching, and sorting algorithms
March 21, 2006 08:57PM

There are a couple of notes for COS211, available for download from my website, made when I did this module 2 years ago.

6 pages. 16 examples of recursive problems, with comments explaining the complex parts.

4 pages. In-depth examples and explanations on the 4 searching algorithms we covered, including their complexities.

15 pages. I made notes on all the sorting algorithms we covered, as well as the additional ones covered in previous years and others that seemed relevant. 10 in total. Here they are: Bubble sort, Selection sort, Insertion sort, Shell sort, Merge sort, Quick sort, Mean sort, Counting sort, Bucket sort, and Radix sort.
The notes include explanations on how they work, sample sorting traces, and their running times in Big O notation.

If anyone wants to contribute additional notes to the page, you're more than welcome to upload your docs smiling smiley

Sorry, only registered users may post in this forum.

Click here to login