Practice Finding Maximum Element In An Array (8.2) - Design and Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the maximum of the array [4, 1, 3, 9, 7]?
Show hintHide hint
Look for the largest number.
Question 2.
How would you initialize the maximum when finding it in an array?
Show hintHide hint
Start with the first element as a reference.
3Question 3.
What is the time complexity to find the maximum in an array?
- O(1)
- O(n)
- O(n^2)
Show hintHide hint
Think about how many elements you need to check.
4Question 4.
True or False: A recursive approach can be faster than an iterative approach for finding maximum.
- True
- False
Show hintHide hint
Consider the function calls involved.
Question 5.
You are given an array of integers with both positive and negative values. Can you devise a method to find the maximum in linear time?
Show hintHide hint
Remember the overall structure of your iterative solution.
Question 6.
Consider an array that includes multiple maximum elements. How would you modify your algorithm to find out how many times the maximum occurs?
Show hintHide hint
You will need to include a conditional check for equality.

5 more questions in this section. Enroll free to practise them all.