Bubble Sort with Ballerina: A Step-by-Step Guide

Bubble Sort Using Ballerina:

Sorting algorithms are the fundamental concept of computer science. Bubble Sort is one of the most straightforward sorting algorithms to learn. In this blog, we’ll implement Bubble Sort using the Ballerina programming language.

What is Bubble Sort?:

Bubble Sort is the simplest sorting algorithm that repeatedly swaps adjacent elements if they’re not in the correct order. However, it’s not ideal for large data sets, as it has high average and worst-case time complexity.

Steps of Bubble Sort:

1. The key idea is to swap with the next element if they’re in the wrong order.

2. After each outer loop iteration, the largest element will settle into its correct position.

3. Implement this with a nested loop structure.

4. The outer loop runs from 0 to arrayLength - 1.

5. The inner loop runs from 0 to arrayLength - i - 2.

6. The outer loop helps count iterations, meaning each pass sorts one more element.

7. The inner loop compares adjacent elements, moving the larger one to the rightmost position in the unsorted section of the array.

Implementation of Bubble Sort in Ballerina:

1. First of all, set up a new ballerina project.

2. To do this, open a terminal and write the following command: bal new bubble_sort_example

3. Open the main.bal file and write the code of bubble sort.

4. Save the code and run the program using the following command in the terminal: bal run.

Code Snippet:

Following is the coding implementation of bubble sort:

import ballerina/io;

// Bubble Sort function
function bubbleSort(int[] arr) {
    int arrayLength = arr.length();

    // Traverse the whole array
    foreach int i in 0 ..< arrayLength - 1 {
        // Last i elements are already in place
        foreach int j in 0 ..< arrayLength - i - 2 {
            if arr[j] > arr[j + 1] {
                // Swap if the elements are not in correct order
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}
public function main() {
    int[] arr = [64, 34, 25, 12, 22, 11, 90];

    // Call the bubbleSort
    bubbleSort(arr);

    io:println("Sorted Array Using Bubble Sort: ", arr);
}

Time and Space Complexity:

Time complexity: O(n^2)

Space complexity: O(1)