# Intro to Algorithm Analysis ADD TO MY COURSES

### Chapter

• #### Chapter 1

Study of an analysis of one of the most basic problems in CS - sorting. Introduction to all basic kinds of analysis of algorithms and asymptotic analysis and notations.

Estimated time: ~50 Minutes
• #### Chapter 2

Discussion of recurrences and recursion trees in the context of merge sort and analyzing the performance of merge sort. It also introduces Big-O notations in the context of algorithm analysis.

Estimated time: ~36 Minutes
• #### Chapter 3

Introduces and analyzes various different types of sorting algorithms. This chapter discusses their efficiency, how they compare to each other and how they are different from each other. It covers bubble sort, quick sort and selection sort. It also introduces the problem of searching, discusses linear and binary search algorithms and their efficiency through analyzing them.

Estimated time: ~40 Minutes
• #### Chapter 4

Introduction to the Divide and Conquer Paradigm of solving problems, in the context of algorithm analysis using recurrences and recursion trees. The most common divide and conquer solutions are introduced - merge sort, binary search, powering a number and Fibonacci.

Estimated time: ~30 Minutes
• #### Chapter 5

Introduction to a common problem in CS - the symbol-table problem and how it is solved through hashing. Discusses hashing concepts such as choosing a hash function and properties of a good hash function, collision resolution through chaining. Presents analysis of the speed of hashing operations.

Estimated time: ~41 Minutes
• #### Locked

You must complete all chapters before taking the course exam.

• ### Concept 1

Bubble Sort is the most basic sort and the easiest sort to implement. It is discussed here together with its details and inner workings.

Estimated time: ~3 Minutes
• ### Concept 2

Bubble Sort is analyzed here, and its performance is discussed. Also the concept of proving by induction is introduced here.

Estimated time: ~7 Minutes
• ### Concept 3

Introduction to selection sort. Selection sort is yet another way of solving the sorting problem. We also look at the performance and analysis of selection sort.

Estimated time: ~4 Minutes
• ### Concept 4

Introduction to the problem of searching for an element in a list. The solutions to this problem are linear search and binary search algorithms. Both algorithms are analyzed and their performance and quirks are compared.

Estimated time: ~7 Minutes
• ### Concept 5

Quick Sort is one of the most efficient (on average) solution to the sorting problem. Here we discuss the inner workings of quick sort.

Estimated time: ~5 Minutes
• ### Concept 6

Introduction to analyzing quick sort. Quick sort's performance is discussed.

Estimated time: ~12 Minutes
• ### Chapter 3 Test

Take the chapter 3 test and unlock the Sorting badge.

### Concept 4: Linear and Binary Search

Introduction to the problem of searching for an element in a list. The solutions to this problem are linear search and binary search algorithms. Both algorithms are analyzed and their performance and quirks are compared.

edit

You are making progress towards completing chapter 3 and unlocking the Sorting Badge

This badge is worth: 50 Points

For this concept you will only be watching a portion of the video: - .

### Ask a Question

Send me an email when someone posts a reply

### Questions & Answers

No one has said anything yet!
Start the discussion by asking a question.

## Quiz Questions

### Concept 4: Linear and Binary Search

• Is Linear Search more efficient than Binary Search?
• What is a problem with binary search?
• What is the running time of Linear Search?