Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Harvard University

CS50 2012 - Week 3 Continued: Search Algorithms and Sorting Techniques

Harvard University via YouTube

Overview

Dive into fundamental computer science concepts with this lecture covering linear and binary search algorithms, asymptotic notation, and various sorting techniques including bubble sort, selection sort, and merge sort. Explore the efficiency and implementation of these algorithms while gaining insights into their real-world applications and performance analysis.

Syllabus

Introduction
Left Standing
Binary Search
Sorting
Not sorted
Swapping
Recap
Geometric Series
Big O
Omega
Merge Sort

Taught by

Harvard University

Reviews

Start your review of CS50 2012 - Week 3 Continued: Search Algorithms and Sorting Techniques

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.