Deck 3: Algorithms

Question 1

Answer 1

Question 2

Answer 2

Question 3

Answer 3

Question 4

Describe an algorithm for finding the smallest integer in a finite sequence of integers.

Question 5

Question 6

Determine the worst case complexity in terms of the number of comparisons used for the algorithm you described in problem 1.

Question 7

Be sure to specify the values of the witnesses C and k.

Question 8