Back to Basics - Generic Data Structures and Algorithms In .NET 2.0

/*  
 Author: Riaan Hanekom

 Copyright 2007 Riaan Hanekom

 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the
 "Software"), to deal in the Software without restriction, including
 without limitation the rights to use, copy, modify, merge, publish,
 distribute, sublicense, and/or sell copies of the Software, and to
 permit persons to whom the Software is furnished to do so, subject to
 the following conditions:

 The above copyright notice and this permission notice shall be
 included in all copies or substantial portions of the Software.

 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/

/*
 * Adapted from CSSSorters, link found on this article page.
 */

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

namespace NGenerics.Sorting
{
	/// <summary>
	/// A Shaker Sorter.
	/// </summary>
	/// <typeparam name="T"></typeparam>
	public sealed class ShakerSorter<T> : Sorter<T>
	{
		#region Sorter<T> Members

		/// <summary>
		/// Sorts the specified list.
		/// </summary>
		/// <param name="list">The list.</param>
		/// <param name="comparer">The comparer to use in comparing items.</param>
		public override void Sort(IList<T> list, IComparer<T> comparer) {

			if (list == null)
			{
				throw new ArgumentNullException("list");
			}
			
			if (comparer == null) {
				throw new ArgumentNullException("comparer");
			}

			if (list.Count < 2) {
				return;
			}

			int i;
			int j;
			int k;
			int min;
			int max;

			i = 0;
			k = list.Count - 1;
			
			while (i < k)
			{
				min = i;
				max = i;
				
				for (j = i + 1; j <= k; j++)
				{
					if (comparer.Compare(list[j], list[min]) < 0)
					{
						min = j;
					}
					if (comparer.Compare(list[j], list[max]) > 0)
					{
						max = j;
					}
				}
				
				this.Swap(list, min, i);
				
				if (max == i)
				{
					this.Swap(list, min, k);
				}
				else
				{
					this.Swap(list, max, k);
				}
				
				i++;
				k--;
			}
		}

		#endregion
	}
}