Algorithms: Sorting and Searching Course (How To)

This course will look at algorithms in two categories: sorting and searching. We'll implement well-known sorting algorithms like selection sort, quicksort, and merge sort. You'll also learn basic search algorithms like sequential search and binary search.

What you'll learn

• Recursion
• Sorting algorithms
• Searching algorithms
• Big O notation

Sorting Algorithms

Let's look at several common sorting algorithms, including Quicksort and Merge Sort.

Chevron 15 steps

• Sorting and Searching

  3:55

• Bogosort

  5:39

• instruction

  Code for Bogosort

• Selection Sort

  6:35

• instruction

  Code for Selection Sort

• Getting the Run Time of a Program

  4:06

• Recursion

  10:00

• Quicksort

  5:54

• Implementing Quicksort

  5:22

• instruction

  Code for Quicksort

• Merge Sort

  7:10

• instruction

  Code for Merge Sort

• Actual Run Time for Sorting Algorithms

  2:13

• Big-O Run Times of Sorting Algorithms

  5:42

• Sorting Algorithms

  11 questions

Searching Names

This stage will cover common algorithms for searching through an array or other collection: Linear Search and Binary Search.

Chevron 8 steps

• Linear Search

  4:22

• instruction

  Code for Linear Search

• Sorting Names

  1:59

• Binary Search

  5:18

• instruction

  Code for Binary Search

• Timing Our Search Scripts

  1:19

• Big O Runtime of Search Algorithms

  1:26

• Search Algorithms

  4 questions