Sorting, Searching and Complexity (Big O)

This session will focus on some important algorithms for sorting and searching. We will also study how the complexity of algorithms can be compared using the Big-O notation.

Presentation slides also in powerpoint

Tasks for week 3

• Activity Sheet 3 – Searching and sorting
• Given code for exercises
• Completed exercises
• Homework sheet

Programs are in a zipped file – download and extract then open with Idle

Back to course materials.