🎓 Check Out My Top 25 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare
In this tutorial, we will write a Program to implement the Selection Sort algorithm in Kotlin programming language.
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning.Selection Sort Algorithm in Kotlin
import java.util.*
fun <E: Comparable<E>> Array<E>.sort() {
val len = size
// Find the minimum value of the array
for (i in 0 until (len - 1)) {
// Getting the index where minimum value is present
var minIndex = i
for (j in (i + 1) until len) {
if (this[j].compareTo(this[minIndex]) < 0) minIndex = j
}
// We got the minimum element, now swap that to first element
val temp = this[minIndex]
this[minIndex] = this[i]
this[i] = temp
}
}
fun <E: Comparable<E>> List<E>.sort(): List<E> {
val len = size
val resultList = toMutableList()
// Find the minimum value of the array
for (i in 0 until (len - 1)) {
// Getting the index where minimum value is present
var minIndex = i
for (j in (i + 1) until len) {
if (resultList[j].compareTo(resultList[minIndex]) < 0) minIndex = j
}
// We got the minimum element, now swap that to first element
val temp = resultList[minIndex]
resultList[minIndex] = resultList[i]
resultList[i] = temp
}
return resultList
}
fun main(args: Array<String>) {
println("Sort array of elements")
val nums = arrayOf(2, 12, 89, 23, 76, 43, 12)
println("Before sorting array of elements")
println(Arrays.toString(nums))
nums.sort()
println("After sorting array of elements")
println(Arrays.toString(nums))
println()
println("Sort List of elements")
val nums1 = listOf(2, 12, 89, 23, 76, 43, 12)
println("Before sorting list of elements")
println(nums1)
val result = nums1.sort()
println("After sorting list of elements")
println(result)
}
Output:
Sort array of elements
Before sorting array of elements
[2, 12, 89, 23, 76, 43, 12]
After sorting array of elements
[2, 12, 12, 23, 43, 76, 89]
Sort List of elements
Before sorting list of elements
[2, 12, 89, 23, 76, 43, 12]
After sorting list of elements
[2, 12, 12, 23, 43, 76, 89]Related Data Structures and Algorithms in Kotlin
- Bubble Sort Algorithm in Kotlin
- Heap Sort Algorithm in Kotlin
- Insertion Sort Algorithm in Kotlin
- Merge Sort Algorithm in Kotlin
- Quick Sort Algorithm in Kotlin
- Selection Sort Algorithm in Kotlin
- Stack Data Structure Implementation in Kotlin
- Queue Data Structure Implementation in Kotlin
- Deque Implementation in Kotlin
- Singly Linked List Implementation in Kotlin
- Doubly Linked List Implementation in Kotlin
- Circular Linked List Implementation in Kotlin
My Top and Bestseller Udemy Courses. The sale is going on with a 70 - 80% discount. The discount coupon has been added to each course below:
Build REST APIs with Spring Boot 4, Spring Security 7, and JWT
[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25
ChatGPT + Generative AI + Prompt Engineering for Beginners
Spring 7 and Spring Boot 4 for Beginners (Includes 8 Projects)
Available in Udemy for Business
Building Real-Time REST APIs with Spring Boot - Blog App
Available in Udemy for Business
Building Microservices with Spring Boot and Spring Cloud
Available in Udemy for Business
Java Full-Stack Developer Course with Spring Boot and React JS
Available in Udemy for Business
Build 5 Spring Boot Projects with Java: Line-by-Line Coding
Testing Spring Boot Application with JUnit and Mockito
Available in Udemy for Business
Spring Boot Thymeleaf Real-Time Web Application - Blog App
Available in Udemy for Business
Master Spring Data JPA with Hibernate
Available in Udemy for Business
Spring Boot + Apache Kafka Course - The Practical Guide
Available in Udemy for Business
Comments
Post a Comment
Leave Comment