Last active
July 17, 2023 20:07
-
-
Save Cariosvertel/7571c565c4bcb13571c6b5684a208308 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Códigos adicionales para desempate | |
```swift | |
print("es par o impar?") | |
var i = 0 | |
while i < 10 { | |
if i % 2 == 0 { | |
print("\(i) es par") | |
} else { | |
print("\(i) es impar") | |
} | |
i += 1 | |
} | |
print() | |
``` | |
```swift | |
print("Se puede dividir por 3?") | |
for j in 0..<10 { | |
if j % 3 == 0 { | |
print("\(j) es divisible por 3") | |
} else { | |
print("\(j) no es divisible por 3") | |
} | |
} | |
print() | |
``` | |
```swift | |
print("Contando hacia atrás") | |
print() | |
var a = 5 | |
while a >= 1 { | |
print("Contando hacia atrás desde \(a):") | |
for b in 1...a { | |
print(b) | |
} | |
a -= 1 | |
} | |
print() | |
``` |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Actividad: Pair Programming Typing Test | |
La actividad consiste en una competencia de escritura de código utilizando ciclos for en el lenguaje de programación Swift. | |
El objetivo principal es mejorar las habilidades de programación y la velocidad de escritura de los participantes. | |
A los estudiantes se les debe proporcionar el primer bloque de código | |
```swift | |
import Foundation | |
var indexMessage = 0 | |
let sampleTextMessage = "exito" | |
``` | |
y a partir de este, participar con los ciclos de la actividad |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import Foundation | |
var indexMessage = 0 | |
let sampleTextMessage = "exito" | |
print("Ejemplo 1: Imprimir 'éxito' cinco veces con ciclo while") | |
indexMessage = 0 | |
while indexMessage < 5 { | |
print("éxito") | |
indexMessage += 1 | |
} | |
print() | |
print("Ejemplo 2: Imprimir cada letra de una cadena de texto con ciclo while") | |
indexMessage = 0 | |
while indexMessage < sampleTextMessage.count { | |
let letter = sampleTextMessage[sampleTextMessage.index(sampleTextMessage.startIndex, offsetBy: indexMessage)] | |
print(letter) | |
indexMessage += 1 | |
} | |
print() | |
print("Ejemplo 3: Imprimir 'éxito' cinco veces con ciclo while (otra variante)") | |
indexMessage = 0 | |
while indexMessage < 5 { | |
print("éxito") | |
indexMessage += 1 | |
} | |
print() | |
print("Ejemplo 4: Imprimir cada letra de una cadena de texto con ciclo while (otra variante)") | |
indexMessage = 0 | |
while indexMessage < sampleTextMessage.count { | |
let letter = sampleTextMessage[sampleTextMessage.index(sampleTextMessage.startIndex, offsetBy: indexMessage)] | |
print(letter) | |
indexMessage += 1 | |
} | |
print() | |
print("Ejemplo 5: Imprimir letras alternativamente en minúsculas y mayúsculas con ciclo while") | |
indexMessage = 0 | |
while indexMessage < sampleTextMessage.count { | |
let letter = sampleTextMessage[sampleTextMessage.index(sampleTextMessage.startIndex, offsetBy: indexMessage)] | |
if indexMessage % 2 == 0 { | |
print(letter.lowercased()) | |
} else { | |
print(letter.uppercased()) | |
} | |
indexMessage += 1 | |
} | |
print() | |
print("Ejemplo 6: Imprimir cada letra de una cadena de texto en orden inverso con ciclo while inverso") | |
indexMessage = sampleTextMessage.count - 1 | |
while indexMessage >= 0 { | |
let letter = sampleTextMessage[sampleTextMessage.index(sampleTextMessage.startIndex, offsetBy: indexMessage)] | |
print(letter) | |
indexMessage -= 1 | |
} | |
print() | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment