voidpointer11 / patatas-bravas Goto Github PK
View Code? Open in Web Editor NEWPara problemitas de algoritmia
Para problemitas de algoritmia
`
def creaMatrizVacia(x, y):
Matrix = [[0 for i in range(y)] for j in range(x)]
return Matrix
def mostrarMatriz(mat):
for i in mat:
for j in i:
print(str(j) + " ", end="")
print("")
def devolverSecuencia(secuenciaA, secuenciaB, secuencia):
long1 = len(secuenciaA)
long2 = len(secuenciaB)
cadena = ""
L = 0
i = 1
j = 1
matrix = [[0 for i in range(long2)] for j in range(long1)]
for x in range(long1):
for y in range(long2):
if secuenciaA[x] == secuenciaB[y]:
if x == 0 or y == 0:
matrix[x][y] = 1
else:
matrix[x][y] = matrix[x-1][y-1] + 1
elif matrix[x-1][y] >= matrix[x][y-1]:
matrix[x][y] = matrix[x-1][y]
else:
matrix[x][y] = matrix[x][y-1]
mostrarMatriz(matrix)
while True:
if matrix[i][j] == matrix[i-1][j-1] + 1:
L += 1
secuencia[L] = secuenciaA[i]
cadena=cadena+ str(secuenciaA[i])
if i < long1:
i += 1
if j < long2:
j += 1
if not L < matrix[long1 - 1][long2 - 1]:
break
print("\nCadena resultante:",cadena)
return L
#secuenciaA = [0, 1, 1]
#secuenciaB = [1, 0, 1, 0]
#secuenciaA =[0,1,1,0,1,0,1,0]
#secuenciaB = [1,0,1,0,0,1,0,0,1]
secuenciaA =[1,1,0,1,0,1,0,0,0,1,0,0] #no funciona con estos
secuenciaB = [1,0,1,0,0,1,0,0,1]
n3 = max(len(secuenciaA), len(secuenciaB))
secuencia = [0 for i in range(n3)]
resultado = devolverSecuencia(secuenciaA,secuenciaB,secuencia)
print(" L = ",resultado)
`
Dijkstra
FALTA el código de esto:
"El código viene acompañado de una función para rellenar las listas aleatoriamente, la funcion main contiene un bucle en el que se imprimen los distintos
tiempos de ejecucion a medida que se aumenta el tamaño de las listas."
La complejidad que hay no es menor a 3/2 de N.
Hay que dividir en de dos en dos, y asignar a una listaMin y una listaMax. Asi hasta que no queden elementos. Parecido a un mergesort diría. Debería dar complejidad menor a 3/2 n.
FALTA código de:
El codigo fuente contiene una demo para probar la funcion
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.