← Back to courses
Programming Fundamentals
Sorting and Searching Algorithms
One week on why some programs are fast and others are not
A one-week classroom course on two topic areas of MIT's published Introduction to Algorithms syllabus (6.006): basic performance measures and sorting, with hash tables for fast lookup. Worked in Python. This course is not affiliated with MIT and prepares for no exam.
5Modules
IntermediateLevel
1 weekDuration
COURSE THUMBNAIL
What you will be able to do
Explain how running time grows with input size
Implement and compare sorting algorithms
Choose between sorting and hashing for a lookup problem
Course outline
01
Measuring performance
02
Simple sorting algorithms
03
Faster sorting: merge sort
04
Searching a sorted list
05
Hash tables for fast lookup
Tools you will use
Python
What you need
Basic Python
