Write an algorithm to find the largest number in a list. The algorithm should be understandable by a person who does not know a computer programming language (not written in code). Do not use pre-defined functions or sorting. The algorithm should be able to be converted into a computer program on a line by line basis (or at least close to it). Example of an algorithm for a binary search: Find the midpoint of the sorted array / list by dividing its length by 2. Compare the midpoint to the value of interest. If the midpoint is larger than the value, perform binary search on right half of the array. If the midpoint is smaller than the value, perform binary search on left half of the array. Repeat these steps until the midpoint value is equal to the value of interest or we know the value is not in the array.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Python language 

**Finding the Largest Number in a List**

To create an algorithm that identifies the largest number within a list, it must be easily interpretable by those without programming knowledge. The steps should avoid using predefined functions or sorting methods, aiming for a straightforward conversion into a computer program if desired.

**Binary Search Algorithm Example:**

1. **Identify Midpoint**: Determine the center of the sorted array or list by halving its length.
   
2. **Comparison**: Assess whether the midpoint is greater or smaller than the target value.
   
3. **Adjust Search Range**:
   - If the midpoint exceeds the target, focus the search on the right half.
   - If the midpoint is less than the target, concentrate on the left half.
   
4. **Repeat**: Continue this approach until the midpoint matches the target value or confirms its absence in the list.
Transcribed Image Text:**Finding the Largest Number in a List** To create an algorithm that identifies the largest number within a list, it must be easily interpretable by those without programming knowledge. The steps should avoid using predefined functions or sorting methods, aiming for a straightforward conversion into a computer program if desired. **Binary Search Algorithm Example:** 1. **Identify Midpoint**: Determine the center of the sorted array or list by halving its length. 2. **Comparison**: Assess whether the midpoint is greater or smaller than the target value. 3. **Adjust Search Range**: - If the midpoint exceeds the target, focus the search on the right half. - If the midpoint is less than the target, concentrate on the left half. 4. **Repeat**: Continue this approach until the midpoint matches the target value or confirms its absence in the list.
**How to Write an Algorithm to Calculate the Average of a List of Numbers**

When designing an algorithm to calculate the average of a list, it's important to make it understandable for those who may not be familiar with programming languages. The instructions should avoid using pre-defined functions but still be close to what a line-by-line program would entail.

**Example Algorithm for a Binary Search:**

1. Find the midpoint of the sorted array or list by dividing its length by 2.
2. Compare the midpoint to the value of interest.
3. If the midpoint is larger than the value, perform a binary search on the right half of the array.
4. If the midpoint is smaller than the value, perform a binary search on the left half of the array.
5. Repeat these steps until the midpoint value equals the value of interest or it is confirmed that the value is not in the array.

This approach allows the problem to be broken down into manageable steps, making complex tasks accessible even to those without coding knowledge.
Transcribed Image Text:**How to Write an Algorithm to Calculate the Average of a List of Numbers** When designing an algorithm to calculate the average of a list, it's important to make it understandable for those who may not be familiar with programming languages. The instructions should avoid using pre-defined functions but still be close to what a line-by-line program would entail. **Example Algorithm for a Binary Search:** 1. Find the midpoint of the sorted array or list by dividing its length by 2. 2. Compare the midpoint to the value of interest. 3. If the midpoint is larger than the value, perform a binary search on the right half of the array. 4. If the midpoint is smaller than the value, perform a binary search on the left half of the array. 5. Repeat these steps until the midpoint value equals the value of interest or it is confirmed that the value is not in the array. This approach allows the problem to be broken down into manageable steps, making complex tasks accessible even to those without coding knowledge.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY