CS50 2012 - Week 3 Continued: Search Algorithms and Sorting Techniques
Harvard University via YouTube
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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