From 91c3e8b03ad736b1d372ffeb1574cd70a8efec20 Mon Sep 17 00:00:00 2001
From: Christoph Ruegg <git@cdrnet.ch>
Date: Sun, 19 Jul 2015 07:05:07 +0200
Subject: [PATCH] Sorting: fix typos in comments

---
 src/Numerics/Sorting.cs | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/src/Numerics/Sorting.cs b/src/Numerics/Sorting.cs
index be9acaf2..28af86e9 100644
--- a/src/Numerics/Sorting.cs
+++ b/src/Numerics/Sorting.cs
@@ -4,7 +4,7 @@
 // http://github.com/mathnet/mathnet-numerics
 // http://mathnetnumerics.codeplex.com
 //
-// Copyright (c) 2009-2013 Math.NET
+// Copyright (c) 2009-2015 Math.NET
 //
 // Permission is hereby granted, free of charge, to any person
 // obtaining a copy of this software and associated documentation
@@ -464,7 +464,7 @@ namespace MathNet.Numerics
         /// <typeparam name="T1">The type of elements in the primary list.</typeparam>
         /// <typeparam name="T2">The type of elements in the secondary list.</typeparam>
         /// <param name="primary">List to sort.</param>
-        /// <param name="secondary">List to to sort on duplicate primaty items, and permute the same way as the key list.</param>
+        /// <param name="secondary">List to sort on duplicate primary items, and permute the same way as the key list.</param>
         /// <param name="primaryComparer">Comparison, defining the primary sort order.</param>
         /// <param name="secondaryComparer">Comparison, defining the secondary sort order.</param>
         public static void SortAll<T1, T2>(IList<T1> primary, IList<T2> secondary, IComparer<T1> primaryComparer = null, IComparer<T2> secondaryComparer = null)
@@ -545,8 +545,8 @@ namespace MathNet.Numerics
                     b--;
                 } while (a <= b);
 
-                // In order to limit the recusion depth to log(n), we sort the
-                // shorter partition recusively and the longer partition iteratively.
+                // In order to limit the recursion depth to log(n), we sort the
+                // shorter partition recursively and the longer partition iteratively.
                 if ((b - left) <= (right - a))
                 {
                     if (left < b)
@@ -635,8 +635,8 @@ namespace MathNet.Numerics
                     b--;
                 } while (a <= b);
 
-                // In order to limit the recusion depth to log(n), we sort the
-                // shorter partition recusively and the longer partition iteratively.
+                // In order to limit the recursion depth to log(n), we sort the
+                // shorter partition recursively and the longer partition iteratively.
                 if ((b - left) <= (right - a))
                 {
                     if (left < b)
@@ -734,8 +734,8 @@ namespace MathNet.Numerics
                     b--;
                 } while (a <= b);
 
-                // In order to limit the recusion depth to log(n), we sort the
-                // shorter partition recusively and the longer partition iteratively.
+                // In order to limit the recursion depth to log(n), we sort the
+                // shorter partition recursively and the longer partition iteratively.
                 if ((b - left) <= (right - a))
                 {
                     if (left < b)
@@ -834,8 +834,8 @@ namespace MathNet.Numerics
                     b--;
                 } while (a <= b);
 
-                // In order to limit the recusion depth to log(n), we sort the
-                // shorter partition recusively and the longer partition iteratively.
+                // In order to limit the recursion depth to log(n), we sort the
+                // shorter partition recursively and the longer partition iteratively.
                 if ((b - left) <= (right - a))
                 {
                     if (left < b)