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
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
DIM n AS LONG
CLS
INPUT "Введите число ", n
INPUT "Введите цифру для поиска ", d
flag = 0
DO WHILE n > 0 AND flag = 0
IF d = n MOD 10 THEN
PRINT "Цифра в числе есть"
flag = 1
ELSE
n = n / 10
END IF
LOOP
IF flag = 0 THEN PRINT "Цифры в числе нет"
END
Тестовое решение:
Введите число 5374012
Введите цифру для поиска 1
Цифра в числе есть