Understanding Quicksort in Kotlin

Table of Contents

Quicksort is a widely-used sorting algorithm known for its efficiency and simplicity. In this article, we’ll delve into the inner workings of Quicksort and implement it in Kotlin.

Introduction to Quicksort

Quicksort is a comparison sort algorithm that follows the divide-and-conquer paradigm. It was developed by Tony Hoare in 1960 and is widely used due to its efficient average-case performance. The algorithm works by selecting a “pivot” element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The process is then recursively applied to the sub-arrays.

Quicksort Algorithm Steps

  1. Pivot Selection:
  • Choose a pivot element from the array. The choice of the pivot significantly affects the algorithm’s performance.
  1. Partitioning:
  • Rearrange the array elements so that elements less than the pivot are on the left, and elements greater than the pivot are on the right.
  1. Recursion:
  • Apply the Quicksort algorithm recursively to the left and right sub-arrays.
  1. Base Case:
  • The base case of the recursion is when the sub-array has one or zero elements, as it is already sorted.

Quicksort Implementation in Kotlin

fun quicksort(arr: IntArray, low: Int, high: Int) {
    if (low < high) {
        // Partition the array, arr[pivotIndex] is now at the correct position
        val pivotIndex = partition(arr, low, high)

        // Recursively sort the sub-arrays
        quicksort(arr, low, pivotIndex - 1)
        quicksort(arr, pivotIndex + 1, high)

fun partition(arr: IntArray, low: Int, high: Int): Int {
    val pivot = arr[high]
    var i = low - 1

    for (j in low until high) {
        if (arr[j] < pivot) {
            // Swap arr[i] and arr[j]
            val temp = arr[i]
            arr[i] = arr[j]
            arr[j] = temp

    // Swap arr[i+1] and arr[high] (pivot)
    val temp = arr[i + 1]
    arr[i + 1] = arr[high]
    arr[high] = temp

    return i + 1

Using Quicksort

To use the Quicksort algorithm, you can call the quicksort function with the array you want to sort:

fun main() {
    val array = intArrayOf(64, 25, 12, 22, 11)

    println("Original Array: ${array.joinToString()}")

    quicksort(array, 0, array.size - 1)

    println("Sorted Array: ${array.joinToString()}")

Choosing the Pivot

The efficiency of Quicksort heavily depends on the choice of the pivot. The implementation above uses the last element as the pivot. However, this approach may lead to suboptimal performance for already sorted or nearly sorted arrays. Alternative strategies include selecting the first element, the middle element, or even using a random element as the pivot.

Here’s an example of using a random pivot:

fun quicksortRandomPivot(arr: IntArray, low: Int, high: Int) {
    if (low < high) {
        val pivotIndex = partitionRandomPivot(arr, low, high)
        quicksortRandomPivot(arr, low, pivotIndex - 1)
        quicksortRandomPivot(arr, pivotIndex + 1, high)

fun partitionRandomPivot(arr: IntArray, low: Int, high: Int): Int {
    val pivotIndex = (low..high).random()
    // Swap arr[pivotIndex] and arr[high] (move the pivot to the end)
    val temp = arr[pivotIndex]
    arr[pivotIndex] = arr[high]
    arr[high] = temp

    return partition(arr, low, high)

Performance Analysis

Quicksort has an average time complexity of O(n log n), making it one of the fastest sorting algorithms. However, in the worst case, it can degrade to O(n^2) if the pivot selection consistently leads to unbalanced partitions. The choice of pivot strategy can mitigate this risk.

Tail Recursion in Kotlin

Kotlin supports tail recursion optimization, a feature that helps prevent stack overflow errors for deep recursive calls. To enable this optimization, you can declare the recursive function as tailrec. In our case, the quicksort function is a good candidate:

tailrec fun quicksort(arr: IntArray, low: Int, high: Int) {
    if (low < high) {
        val pivotIndex = partition(arr, low, high)
        quicksort(arr, low, pivotIndex - 1)
        quicksort(arr, pivotIndex + 1, high)


Quicksort remains a powerful and efficient sorting algorithm, especially when optimized for various scenarios. By understanding pivot strategies and optimizing for tail recursion in Kotlin, you can enhance its performance and make it suitable for a wide range of use cases. Remember to choose the pivot wisely and consider tail recursion optimization for large datasets to achieve the best results.

Undefined vs Null in JavaScript

Undefined vs Null in JavaScript

JavaScript, as a dynamically-typed language, provides two distinct primitive values to represent the absence of a meaningful value: undefined and null. Although they might seem

Read More »