Bubble sort on linked list in scala

Scala program for Bubble sort on linked list. Here more solutions.

// Scala program for
// Bubble Sort For Linked List
class Node (var data : Int = 0, var next : Node = null)
{
    def this(data : Int)
    {
        this(data, null)
    }
}
class LinkedList (var head : Node = null)
{
    // Class constructors
    def this()
    {
        this(null)
    }
    // Add node at the beginning of linked list
    def insert(value : Int) : Unit=
    {
        // Create a new node
        var node = new Node(value)
        // Add node at front
        node.next = this.head
        // Make new head
        this.head = node
    }
    // Display all elements
    def display() : Unit=
    {
        if (this.head != null)
        {
            var temp = this.head
            while (temp != null)
            {
                // Display node value
                print("  " + temp.data)
                // Visit to next node
                temp = temp.next
            }
        }
        else
        {
            println("Empty Linked list")
        }
    }
    // Perform bubble sort in single linked list
    def bubbleSort() : Unit=
    {
        if (head != null)
        {
            var current : Node = null
            var status = false
            do {
                // Start with first node
                current = this.head
                // Reset working status
                status = false
                while (current != null && current.next != null)
                {
                    if (current.data > current.next.data)
                    {
                        // Swap node values
                        current.data = current.data + current.next.data
                        current.next.data = current.data - current.next.data
                        current.data = current.data - current.next.data
                        // When node value change
                        status = true
                    }
                    // Visit to next node
                    current = current.next
                }
            } while (status)
        }
        else
        {
            println("Empty Linked list")
        }
    }
}

object Main 
{
	def main(args : Array[String]) : Unit=
    {
        var task = new LinkedList()
        // Insert element of linked list
        task.insert(15)
        task.insert(5)
        task.insert(42)
        task.insert(9)
        task.insert(50)
        task.insert(7)
        print(" Before sort : ")
        // Display all node
        task.display()
        task.bubbleSort()
        print("\n After sort  : ")
        task.display()
    }
}

Output

 Before sort :   7  50  9  42  5  15
 After sort  :   5  7  9  15  42  50