def bubbleSort(arr):
n = len(arr)
count = 0
# Traverse through all array elements
for i in range(n-1):
# range(n) also work but outer loop will repeat one time more than needed.
# Last i elements are already in place
for j in range(0, n-i-1):
# traverse the array from 0 to n-i-1
# Swap if the element found is greater
# than the next element
if arr[j] > arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]
count = count+1
return count
list = [8, 1, 7, 4, 3, 9, 2, 5, 6, 10]
count = bubbleSort(list)
print(count)
Объяснение:
ответ: 18
1) Произведение отрицательных чисел
uses crt;
var
a:array [1..100] of integer;
i,n,s:integer;
begin
clrscr;
write ('Введите количество элементов массива:');
readln (n);
for i:=1 to n do
a[i]:=random (15)-10;
write (a[i],' ');
writeln;
for i:=1 to n do
if a[i]<0 then
s:=s*a[i];
writeln ('s=',s);
readln
end.
2) Сумма четных чисел
uses crt;
var
a:array [1..100] of integer;
i,n,s:integer;
begin
clrscr;
write ('Введите количество элементов массива:');
readln (n);
for i:=1 to n do
a[i]:=random (15)-10;
write (a[i],' ');
writeln;
for i:=1 to n do
if a[i] mod 2 = 0 then
s:=s+a[i];
writeln ('s=',s);
readln
end.
3) Последнее попробуй сам решить. Удачи:)