Insertion Sort Algorithm in Scala

1. Introduction

Insertion Sort is a simple and intuitive comparison-based sorting algorithm. The main concept behind insertion sort involves imagining a card game where each card is picked and placed in its correct position. Similarly, in insertion sort, the list is divided into a sorted and an unsorted part. We pick one element from the unsorted part and insert it into its correct position in the sorted sublist.

2. Implementation Steps

1. Start from the second element (assume the first element is sorted).

2. Compare the current element with the previous elements.

3. If the current element is smaller than the previous one, compare it with the elements before the previous one.

4. Repeat the process until the correct position is found for the current element or it reaches the beginning of the list.

5. Insert the element in its correct position.

6. Repeat the process for all elements in the list.

3. Implementation in Scala

object InsertionSort {
  def sort(arr: Array[Int]): Array[Int] = {
    for (i <- 1 until arr.length) {
      val key = arr(i)
      var j = i - 1
      // Move elements of arr[0..i-1] that are greater than key
      // to one position ahead of their current position
      while (j >= 0 && arr(j) > key) {
        arr(j + 1) = arr(j)
        j = j - 1
      }
      arr(j + 1) = key
    }
    arr
  }
}

Client Code:

val arr = Array(12, 11, 13, 5, 6)
println("Original Array: " + arr.mkString(", "))
val sortedArr = InsertionSort.sort(arr)
println("Sorted Array: " + sortedArr.mkString(", "))

Output:

Original Array: 12, 11, 13, 5, 6
Sorted Array: 5, 6, 11, 12, 13

Explanation:

1. object InsertionSort: This is the singleton object for the Insertion Sort algorithm in Scala.

2. sort(arr: Array[Int]): The method performing the insertion sort on an array of integers.

3. for (i <- 1 until arr.length): Looping from the second element to the last.

4. val key = arr(i): Storing the current element whose left side is checked for its correct position.

5. var j = i - 1: Initializing the variable j which is used to traverse the sorted part of the array.

6. while (j >= 0 && arr(j) > key): If j is a valid index and the element at j is greater than key, we need to find a new position for key.

7. arr(j + 1) = arr(j): Shifting the element to make space for key.

8. arr(j + 1) = key: Placing the key in its correct position.

9. Client Code: Demonstrates how to use the InsertionSort object to sort an array.

With this approach, the array is successfully sorted in ascending order using the Insertion Sort algorithm in Scala.


Related Scala Source Code Examples:

Scala program to print hello world Scala program to find the factorial of a number Scala program to check if a number is prime Scala program to find the Fibonacci series Scala program to reverse a string Scala program to count vowels in a string Scala program to implement bubble sort Scala program to find the largest element in an array Scala program to perform matrix multiplication Scala program to add two number Scala program to find prime numbers Scala program to check palindrome Scala program to find the maximum and minimum of an array Scala program to calculate the area of a circle Scala program to find the GCD of two numbers Scala program to check if a string is a palindrome Scala program to find the sum of digits of a number Scala program to count the number of words in a sentence Scala program to remove duplicates from a list Scala program to find the power of a number using recursion Scala program to convert Celsius to Fahrenheit Scala program to calculate compound interest Scala program to find the common elements in two arrays Scala program to check if two strings are anagrams Scala program to replace all occurrences of a substring Scala program to find the longest substring without repeating characters Scala program to split a string by a delimiter Scala program to find the sum and average of elements in an array Scala program to reverse an array Scala program to check if an array contains a specific value Scala program to merge two arrays Scala program to remove duplicates from an array Scala program to find the intersection of two arrays Scala program to find the rotation point in a rotated sorted array Scala program to find the power of a number Scala program to find all divisors of a number Scala program to reverse a list Scala program to concatenate two lists Scala program to find the last element in a list Scala program to remove duplicates from a list Scala program to sort a list of numbers Scala program to find the intersection of two lists Scala program to implement tail recursion Scala program to use Option, Some, and None for null safety Scala - custom flatMap or map function Scala program to calculate leap years Scala - Data Types Example Scala - Access Modifiers Example Scala - Arithmetic Operators Example Scala - Relational Operators Example Scala - Logical Operators Example Scala - Bitwise Operators Example Scala - IF ELSE Statements Example Scala - Loop Statements Example Scala - Functions Example Scala - Closures Example Scala - String Functions with Examples Scala - Array Functions with Examples Scala List Methods with Examples Scala Set Methods with Examples Scala Map Methods with Examples Scala - Tuples Example Scala - Exception Handling Example Scala Iterate Over an Array Scala Iterate Over List (Different Ways) Scala Iterate Over Map (Different Ways) Scala Iterate List With Index Scala Iterate Over List of Objects (Different Ways) Scala Iterate Over String Scala Convert List to Map Scala Convert String to Int Scala Convert String to Boolean Scala Convert String to Timestamp Scala Convert String to JSON Scala Convert String to Long Scala Convert Date to Epoch Scala Convert Map to JSON Scala Check if the List Contains an Element Scala Check if List Is Null or Empty Scala Check if List Contains Duplicates Scala Check if String Is Null or Empty Scala Check if Option Is None Scala Check Option Has Value Stack Implementation in Scala Queue Implementation in Scala Priority Queue Implementation in Scala Linked List Implementation in Scala Doubly Linked List Implementation in Scala Circular Linked List Implementation in Scala Binary Tree Implementation in Scala Bubble Sort Algorithm in Scala Selection Sort Algorithm in Scala Insertion Sort Algorithm in Scala Merge Sort Algorithm in Scala Quick Sort Algorithm in Scala Heap Sort Algorithm in Scala Shell Sort Algorithm in Scala Linear Search Algorithm in Scala Binary Search Algorithm in Scala

Comments

Post a Comment