📘 Premium Read: Access my best content on Medium member-only articles — deep dives into Java, Spring Boot, Microservices, backend architecture, interview preparation, career advice, and industry-standard best practices.

🎓 Top 15 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare — All my Udemy courses are real-time and project oriented courses.

▶️ Subscribe to My YouTube Channel (176K+ subscribers): Java Guides on YouTube

▶️ For AI, ChatGPT, Web, Tech, and Generative AI, subscribe to another channel: Ramesh Fadatare on YouTube

In this tutorial, we will write a Program to implement the Bubble Sort algorithm in Kotlin programming language.

Bubble Sort Algorithm is one of the simplest sorting algorithms. The bubble sort repeatedly compares adjacent values and swaps them, if needed, to perform the sort. The larger values in the set will, therefore, bubble up to the end of the collection.

Bubble Sort Algorithm in Kotlin

Let's write the Kotlin program to implement the Bubble sort algorithm to sort elements in ascending order as well as in descending order:

import java.util.*

fun <E: Comparable<E>> Array<E>.sort() {
    val len = size
    for (i in 0 until (len - 1)) {
        for (j in 0 until (len - i - 1)) {
            if (this[j].compareTo(this[j + 1]) > 0) {
                val temp = this[j]
                this[j] = this[j + 1]
                this[j + 1] = temp
            }
        }
    }
}

fun <E: Comparable<E>> Array<E>.descending() {
    val len = size
    for (i in 0 until (len - 1)) {
        for (j in 0 until (len - i - 1)) {
            if (this[j].compareTo(this[j + 1]) < 0) {
                val temp = this[j]
                this[j] = this[j + 1]
                this[j + 1] = temp
            }
        }
    }
}

fun main(args: Array<String>) {
    val nums = arrayOf(2, 12, 89, 23, 76, 43, 12)
    nums.sort()
    println(Arrays.toString(nums))
    nums.descending()
    println(Arrays.toString(nums))
}

Output:

[2, 12, 12, 23, 43, 76, 89]
[89, 76, 43, 23, 12, 12, 2]

This method sorts the elements in ascending order:

fun <E: Comparable<E>> Array<E>.sort() {
    val len = size
    for (i in 0 until (len - 1)) {
        for (j in 0 until (len - i - 1)) {
            if (this[j].compareTo(this[j + 1]) > 0) {
                val temp = this[j]
                this[j] = this[j + 1]
                this[j + 1] = temp
            }
        }
    }
}

This method sorts the elements in descending order:

fun <E: Comparable<E>> Array<E>.descending() {
    val len = size
    for (i in 0 until (len - 1)) {
        for (j in 0 until (len - i - 1)) {
            if (this[j].compareTo(this[j + 1]) < 0) {
                val temp = this[j]
                this[j] = this[j + 1]
                this[j + 1] = temp
            }
        }
    }
}

Related Data Structures and Algorithms in Kotlin

1. Bubble Sort Algorithm in Kotlin
2. Heap Sort Algorithm in Kotlin
3. Insertion Sort Algorithm in Kotlin
4. Merge Sort Algorithm in Kotlin
5. Quick Sort Algorithm in Kotlin
6. Selection Sort Algorithm in Kotlin
7. Stack Data Structure Implementation in Kotlin
   
8. Queue Data Structure Implementation in Kotlin
   
9. Deque Implementation in Kotlin
   
10. Singly Linked List Implementation in Kotlin
    
11. Doubly Linked List Implementation in Kotlin
    
12. Circular Linked List Implementation in Kotlin