Scribd Logo
Upload

Welcome to Scribd!

  • Solucion Reto Semana 3 Borrado

    Uploaded by

    Diego Marin
    6 views1 page
    This Python code defines a function that generates a random original vector of 15-30 random numbers between 1-9999. It then makes a copy of the vector and iterates through it, checking if the first digit of each number is even. If even, it appends the number to a new modified vector and removes it from the copy. Finally, it sorts the modified vector in descending order and appends the remaining numbers from the copy to output the original and modified vectors.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Python code defines a function that generates a random original vector of 15-30 random numbers between 1-9999. It then makes a copy of the vector and iterates through it, checking if the first digit of each number is even. If even, it appends the number to a new modified vector and removes it from the copy. Finally, it sorts the modified vector in descending order and appends the remaining numbers from the copy to output the original and modified vectors.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Solucion Reto Semana 3 Borrado

    Uploaded by

    Diego Marin
    This Python code defines a function that generates a random original vector of 15-30 random numbers between 1-9999. It then makes a copy of the vector and iterates through it, checking if the first digit of each number is even. If even, it appends the number to a new modified vector and removes it from the copy. Finally, it sorts the modified vector in descending order and appends the remaining numbers from the copy to output the original and modified vectors.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    import random

    def solucion():
    numAle = random.randint(15, 30)
    #print(numAle)
    vectorOrigen = []
    for i in range(numAle):
    #print(i)
    numero = random.randint(1, 9999)
    vectorOrigen.append(numero)

    vectorCopia = vectorOrigen.copy()

    vectorMod = []

    #print("vector origen")
    #print(vectorOrigen)

    i=0
    while i < len(vectorCopia) :
    numero = str(vectorCopia[i])
    primerDigito = numero[0]
    if int(primerDigito)%2==0 :
    vectorMod.append(int(numero))
    vectorCopia.pop(i)
    i=i-1
    i+=1

    vectorMod.sort(reverse=True)
    vectorMod.extend(vectorCopia)

    return vectorOrigen,vectorMod

    print(solucion())

    You might also like