Question

Devise an algorithm that takes a list of n > 1 integers and finds the largest and smallest values in the list.

Answer 1

In algorithm, we have implemented the Bubble Sort algorithm that will sort the list element in an ascending order. The First element of the list will always be smallest element and the last element of the list will always be largest element of the list. Please rate our program as Helpful. Let us know if there is any further query. Thanks.

Explanation:

Solution:

Algorithm_1(DATA, N)

1. Start
2. Read the Array DATA with N Number of elements in the list.
3. Repeat Steps 4 and 5 for K = 1 to N-1
4. Set PTR := 1[Initialize the Pointer Variable]
5. Repeat while PTR ≤ N-K (Execute Pass)

(a) if DATA[PTR] > DATA[PTR + 1] then:

i. Set temp := DATA[PTR]

ii. Set DATA[PTR] := DATA[PTR +1]

iii. Set DATA[PTR + 1] := temp

[End of If Structure]

(b) Set PTR := PTR +1

[End of Inner Loop]

[End of Step Outer 3 Loop]

6. Set Smallest := DATA[0]

7. Set Largest := DATA[N-1]

8. Exit.