Q1. Write an algorithm that finds the smallest number in a list (an array) of n numbers Q2. Describe the type of time complexity algorithm in the question 1 has, and explain why.
Q1. Write an algorithm that finds the smallest number in a list (an array) of n numbers Q2. Describe the type of time complexity algorithm in the question 1 has, and explain why.
Related questions
Question
for question 1, please use java language for coding
![Q1. Write an algorithm that finds the
smallest number in a list (an array) of n
numbers
Q2. Describe the type of time complexity
algorithm in the question 1 has, and
explain why.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff04edf1d-99e6-4a6f-9176-9738f225b26e%2F936196e6-181c-4820-8833-88c29bec6dd7%2Fj2pm53w_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Q1. Write an algorithm that finds the
smallest number in a list (an array) of n
numbers
Q2. Describe the type of time complexity
algorithm in the question 1 has, and
explain why.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)