Lecture 4

Question 1

What is a randomized algorithm?

Answer 1

Question 2

What are two types of randomized algorithms?

Answer 2

Question 3

What is the worst-case runtime for randomized algorithms?

Answer 3

Question 4

What is the expected runtime?

Answer 4

Question 5

What is the key idea of BogoSort?

Answer 5

Question 6

What is the pseudocode of BogoSort?

Answer 6

Question 7

What is the worst-case runtime of BogoSort?

Answer 7

Question 8

What is the expected runtime of BogoSort?

Answer 8

Question 9

How does QuickSort work?

Answer 9

Question 10

What is the pseudocode of QuickSort?

Answer 10

Question 11

What are the differences between QuickSort and MergeSort?

Answer 11

Question 12

How does the Partition part of QuickSort work?

Answer 12

Question 13

What is the Pseudocode of the partition part of QuickSort?

Answer 13

Question 14

What is the recurrence of QuickSort?

Answer 14

Question 15

What is the worst-case runtime of QuickSort?

Answer 15

Question 16

What is the best-case runtime of QuickSort?

Answer 16

Question 17

How is the expected runtime of QuickSort derived?

Answer 17

Question 18

What is the expected, worst, and best-case runtime of QuickSort?

Answer 18