Programas feito em aula, 16 de Outubro
def busca_binaria(lista, item, begin, end):
if begin <= end:
m=(begin+end)//2
if lista[m] ==item:
print("O elemento ", item, " foi encontrado, com indice ", m)
elif item < lista[m]:
return busca_binaria(lista, item, begin, m-1)
else:
return busca_binaria(lista, item, m+1, end)
###################
# Driver code, below
L= [1, 2, 5, 7, 8, 10, 10, 10, 11, 13, 14, 14, 17, 19, 20, 1001, 10000]
item=14
end= len(L)
busca_binaria(L, item, 0, end)
#############################################
#############################################
def countdown(n):
print(n)
if n > 0:
countdown(n - 1)
# Driver code:
countdown(5)
#############################################
#############################################
def countdown(n):
print(n)
if n == 0:
return # encerrar a recursão
else:
countdown(n - 1) # uma chamada de recursão
#################
# Driver code:countdown(5)
#############################################
#############################################
"""
Isso é uma funcato recursiva, para encontrar
o fatorial de qualquer inteiro
This is a recursive function
to find the factorial of an integer
"""
def factorial(n):
if n == 0:
return 1
else:
return (n * factorial(n-1))
# Driver code:
for i in range(10):
print( i, " fatorial é ", factorial(i) )