YoVDO

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

Offered By: Harvard University via YouTube

Tags

Algorithms Courses Computer Science Courses Data Structures Courses Sorting Algorithms Courses Algorithm Analysis Courses Asymptotic Notation Courses Computational Complexity Courses Search Algorithms Courses

Course Description

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

Tags

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera