Question

3. Modify the insertion sort algorithm discussed in class so that it can sort strings. That is, its input will be an array, the type of which is string. The insertion sort algorithm will sort the elements in this array. Finally, its output will be a sorted array.

As the solution of this problem, you need to submit the following answer(s): (1). The implementation of your algorithm in C# (20points).

Algorithm: At each array-position, it checks the value there against the largest value in the sorted list (which happens to be next to it, in the previous array-position checked) If larger, it leaves the element in place and moves to the next. If smaller, it finds the correct position within the sorted list, shifts all the larger values up to make a space, and inserts into that correct position Insertion sort Implementation in C# int inner, for int outer temp; 1; outer

Answer 1

CODE:

using System.IO;
using System;

class Program
{
    static void Main()
    {
        // create an array of strings
        string [] a = {"Arka","tapas","jonas","Henry"};
        // print the array
        Console.WriteLine("Before Sorting: ");
        foreach(var i in a)
            Console.Write(i + "\t");
        Console.WriteLine();
        // call insertion sort method
        InsertionSort(a);
        Console.WriteLine("\nAfter Sorting: ");
        // printing the array after sorting
        foreach(var i in a)
            Console.Write(i + "\t");
        Console.WriteLine();
    }
    static void InsertionSort(IComparable[] a)
    {
        int i,j;
        // outer loop
        for(i=1;i<a.Length;i++)
        {
            IComparable val = a[i];
            j = i-1;
            // inner loop
            while((j>=0)&&(a[j].CompareTo(val)>0))
            {
                a[j+1]=a[j];
                j--;
            }
            a[j+1]=val;
          
          
        }
    }
}

OUTPUT:

I Result Şmcs.cs -out:main.ex e Şmono main.exe Before Sorting: Arka jonas tapas Henry After Sorting: jonas Arka Henry tapas