Insert Sort : Sort « Collections Data Structure « C# / C Sharp

1. C# / C Sharp
2. Collections Data Structure
3. Sort

Insert Sort

  

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Sort
{

    public class InsertSort
    {
        public int[] arrForSort = new int[100];

        public InsertSort(int[] arr)
        {
            this.arrForSort = arr;
        }

        public int[] Execute()
        {
            int i, j, temp;

            for (i = 1; i < arrForSort.Length; i++)
            {
                temp = arrForSort[i];

                for (j = i; j > 0 && temp < arrForSort[j-1]; j--)
                {
                    arrForSort[j] = arrForSort[j - 1];
                }

                arrForSort[j] = temp;
            }

            return arrForSort;
        }
    }
}

   
    
  

Related examples in the same category

1.	Implements the recursive merge sort algorithm to sort an array
2.	Sorts an array of data using the insertion sort algorithm
3.	Bubble sort
4.	A simple version of the Quicksort
5.	Demonstrate the Bubble sort
6.	A simple stable sorting routine - far from being efficient, only for small collections.
7.	Quick Sort