Working on sorting algos.

Author: Clément

source/code/projects/Sorting/Sorting/Program.cs

@@ -15,7 +15,7 @@ static void Main(string[] args)
         Demo.Run(Sorting<int>.BubbleSort);
         Demo.Run(Sorting<char>.BubbleSort);
 
-        Demo.Run(Sorting<int>.ShellSort);
+        Demo.Run(Sorting<int >.ShellSort);
         Demo.Run(Sorting<char>.ShellSort);
 
     }

source/code/projects/Sorting/Sorting/Sorting.cs

@@ -7,9 +7,9 @@ static class Sorting<T> where T : IComparable<T>
     // Helper method
     private static void Swap(List<T> listP, int lhs, int rhs)
     {
-        T temp = listP[lhs];
+        T current = listP[lhs];
         listP[lhs] = listP[rhs];
-        listP[rhs] = temp;
+        listP[rhs] = current;
     }
     public static bool IsSorted(List<T> listP)
     {
@@ -121,20 +121,18 @@ public static void ShellSort(List<T> listP)
                     listP[slot] = current;
                 }
             }
-        }
-
-
-  
-
-        // ================================================================================
-        //
-        //    QuickSort Algorithm
-        //
-        // ================================================================================
-        public static void QuickSort(List<T> listP, int stopOn = 3)
+        }
+
+    // Done with shellSort Algorithm
+
+
+
+
+
+    // QuickSort Algorithm
+
+    public static void QuickSort(List<T> listP, int stopOn = 3)
         {
-            Console.WriteLine("-------- QuickSort ---------");
-
             QuickSort(listP, 0, listP.Count - 1, stopOn);
             Console.WriteLine("After QuickSort but before it calls InsertionSort");
             Displaying<T>.Display(listP);
@@ -198,19 +196,15 @@ public static void QuickSort(List<T> listP, int left, int right, int stopOn)
             }
         }
 
-        // ================================================================================
-        //
-        //    Selection Sort Algorithm
-        //
-        // ================================================================================
+        // Selection Sort Algorithm
         public static void SelectionSort(List<T> listP)
         {
             SelectionSort(listP, 0, listP.Count - 1);
         }
 
         private static void SelectionSort(List<T> listP, int low, int high)
         {
-            T temp;
+            T current;
             for (int i = low; i <= high; ++i)
             {
                 T min = listP[i];       // smallest element so far
@@ -225,20 +219,18 @@ private static void SelectionSort(List<T> listP, int low, int high)
 
                 if (i != min_index)
                 {
-                    temp = listP[i];
+                    current = listP[i];
                     listP[i] = min;
-                    listP[min_index] = temp;
+                    listP[min_index] = current;
                 }
             }
         }
+        // End of selection sort algorithm
+
 
 
+        //  Merge Sort Algorithm
 
-        // ================================================================================
-        //
-        //    Merge Sort Algorithm
-        //
-        // ================================================================================
         public static void RecMergeSort(List<T> listP)
         {
             RecMergeSort(listP, 0, listP.Count);