Sorts its argument (destructively) using insert sort; - CSharp Data Structure Algorithm

CSharp examples for Data Structure Algorithm:Sort

  1. HOME
  2. CSharp
  3. Data Structure Algorithm
  4. Sort

Description

Sorts its argument (destructively) using insert sort;

Demo Code

/*/*from  w  w w  .  j  a  v a 2 s .c  o  m*/
* Copyright 2007 ZXing authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
*      http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
using System.Collections.Generic;
using System;

public class Main{
        /// <summary> Sorts its argument (destructively) using insert sort; in the context of this package
        /// insertion sort is simple and efficient given its relatively small inputs.
        /// 
        /// </summary>
        /// <param name="vector">vector to sort
        /// </param>
        /// <param name="comparator">comparator to define sort ordering
        /// </param>
        public static void insertionSort(List<Object> vector, Comparator comparator)
        {
            int max = vector.Count;
            for (int i = 1; i < max; i++)
            {
                Object value_Renamed = vector[i];
                int j = i - 1;
                Object valueB;
                while (j >= 0 && comparator.compare((valueB = vector[j]), value_Renamed) > 0)
                {
                    vector[j + 1] = valueB;
                    j--;
                }
                vector[j + 1] = value_Renamed;
            }
        }
}

Related Tutorials