Question: JAva Q1 Section 1.1 Exercise 1 Write an algorithm that finds the largest number in a list (an array) of n numbers. (pseudo code) Q2

JAva

Q1 Section 1.1 Exercise 1

Write an algorithm that finds the largest number in a list (an array) of n numbers. (pseudo code)

Q2 Section 1.2 Exercise 8

Under what circumstances, when a searching operation is needed, would Sequential Search (Algorithm 1.1) not be appropriate?

Q3 Section 1.3 Exercise 10 (for just Exercise 1)

Define the basic operation for your algorithm in Exercises 1, and study the performance of your algorithm. If your algorithm has an every-case time complexity, determine it. Otherwise, determine the worst-case time complexity.

Q4 Implement your algorithm form Q1 in a programming language of your choice, so as to print out time taken. Try various inputs and comment on whether your experimental results support your analyzed time complexity from Q3

Please Thank you so much

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!