Text Practice Mode
Kotlin codes
created Nov 19th 2023, 17:11 by Mirshod Mirjonov
0
253 words
0 completed
0
Rating visible after 3 or more votes
fun fibonacci(n: Int): Int {
return if (n <= 1) {
n
} else {
fibonacci(n - 1) + fibonacci(n - 2)
}
}
fun factorial(n: Int): Int {
return if (n <= 1) {
1
} else {
n * factorial(n - 1)
}
}
fun bubbleSort(arr: IntArray) {
val n = arr.size
for (i in until n - 1) {
for (j in until n - i - 1) {
if (arr[j] > arr[j + 1]) {
val temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp
}
}
}
}
fun binarySearch(arr: IntArray, target: Int): Int {
var low = 0
var high = arr.size - 1
while (low <= high) {
val mid = (low + high) / 2
when {
arr[mid] == target -> return mid
arr[mid] < target -> low = mid + 1
else -> high = mid - 1
}
}
return -1
}
fun main() {
// Test Fibonacci
val n = 10
println("Fibonacci sequence up to $n terms:")
for (i in until n) {
print("${fibonacci(i)} ")
}
println()
val factorialNumber = 5
println("Factorial of $factorialNumber is: ${factorial(factorialNumber)}")
// Test Bubble Sort
val array = intArrayOf(64, 34, 25, 12, 22, 11, 90)
println("Original array: ${array.joinToString(", ")}")
bubbleSort(array)
println("Sorted array: ${array.joinToString(", ")}")
// Test Binary Search
val target = 25
val result = binarySearch(array, target)
if (result != -1) {
println("$target found at index $result")
} else {
println("$target not found in the array")
}
}
saving score / loading statistics ...
00:00
fun fibonacci(n: Int): Int {
return if (n <= 1) {
n
} else {
fibonacci(n - 1) + fibonacci(n - 2)
}
}
fun factorial(n: Int): Int {
return if (n <= 1) {
1
} else {
n * factorial(n - 1)
}
}
fun bubbleSort(arr: IntArray) {
val n = arr.size
for (i in until n - 1) {
for (j in until n - i - 1) {
if (arr[j] > arr[j + 1]) {
val temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp
}
}
}
}
fun binarySearch(arr: IntArray, target: Int): Int {
var low = 0
var high = arr.size - 1
while (low <= high) {
val mid = (low + high) / 2
when {
arr[mid] == target -> return mid
arr[mid] < target -> low = mid + 1
else -> high = mid - 1
}
}
return -1
}
fun main() {
// Test Fibonacci
val n = 10
println("Fibonacci sequence up to $n terms:")
for (i in until n) {
print("${fibonacci(i)} ")
}
println()
val factorialNumber = 5
println("Factorial of $factorialNumber is: ${factorial(factorialNumber)}")
// Test Bubble Sort
val array = intArrayOf(64, 34, 25, 12, 22, 11, 90)
println("Original array: ${array.joinToString(", ")}")
bubbleSort(array)
println("Sorted array: ${array.joinToString(", ")}")
// Test Binary Search
val target = 25
val result = binarySearch(array, target)
if (result != -1) {
println("$target found at index $result")
} else {
println("$target not found in the array")
}
}
saving score / loading statistics ...