Question

СОСТАВЬТЕ ПРОГРАММУ ПОИСКА НАИМЕНЬШЕГО ЭЛЕМЕНТА В МАССИВЕ А(10), СОСТОЯЩЕМ ИЗ ЧИСЕЛ : 7,3,4,8,10,-9,6,1,4,-2.

Answer 1

Ответ:

Pascsal:  *название массива*.min

Например, writeln(A.min);    A - название массива

Python: min(*название массива*)

Например, print(min(A))       A - название массива

C++:

int A[10] = {7, 3, 4, 8, 10, -9, 6, 1, 4, -2};

int min = A[0];

for(int i = 0; i < 10; i++) {

   if(A[i] < min) { min = A[i]; }

}

Answer 2

int[] massive = {7,3,4,8,10,-9,6,1,4,-2};

int mn = Integer.MAX_VALUE;

for(int el : massive) {

if(el < mn) {

mn = el;

}

}

Answer 3

Program to Find the Smallest Element in an Array

To write a program to find the smallest element in an array A(10) consisting of the numbers: 7, 3, 4, 8, 10, -9, 6, 1, 4, -2, you can use the following algorithm:

1. Initialize a variable `smallest` with the first element of the array. 2. Iterate through the remaining elements of the array. 3. Compare each element with the current value of `smallest`. 4. If the current element is smaller than `smallest`, update the value of `smallest` to the current element. 5. After iterating through all the elements, the value of `smallest` will be the smallest element in the array.

Here's an example of a program written in Python that implements this algorithm:

A = [7, 3, 4, 8, 10, -9, 6, 1, 4, -2]
smallest = A[0]

for i in range(1, len(A)):
    if A[i] < smallest:
        smallest = A[i]

print("The smallest element in the array is:", smallest)

When you run this program, it will output:

The smallest element in the array is: -9

Please note that this is just one way to solve the problem, and there are other approaches as well. The provided solution iterates through the array and compares each element with the current smallest element. If a smaller element is found, it updates the value of `smallest`.