Added Pancake Sort

Author: nathanjukes

.vs/SortingAlgorithmVisualisation/v16/.suo

@@ -8,8 +8,8 @@
   <a href="https://scrutinizer-ci.com/g/pH7Software/pH7-Social-Dating-CMS/build-status/master">
       <img src="https://scrutinizer-ci.com/g/pH7Software/pH7-Social-Dating-CMS/badges/build.png?b=master">
   </a>
-  <a href="https://img.shields.io/badge/version-v1.06-blue">
-    <img src="https://img.shields.io/badge/version-v1.06-blue">
+  <a href="https://img.shields.io/badge/version-v1.07-blue">
+    <img src="https://img.shields.io/badge/version-v1.07-blue">
   </a>
   <a href="https://github.com/nathanjukes/Sorting-Algorithm-Visualisation/blob/master/LICENSE.md">
     <img src="https://img.shields.io/github/license/Naereen/StrapDown.js.svg">
@@ -34,6 +34,8 @@ Or download here:
 
 ## Change Log
 
+- 1.07 - Added Pancake Sort
+
 - 1.06 - Added Tree Sort (Pre-Order Traversal)
 
 - 1.05 - Added Cycle Sort

README.md

@@ -22,12 +22,12 @@ public abstract class AlgorithmBase
         public abstract int elementCount { get; set; }
         public abstract void BeginAlgorithm(int[] elements);
 
-        public void ShowCompletedDisplay(int[] elements)
+        public async void ShowCompletedDisplay(int[] elements)
         {
-            ShowAllGreen(elements);
+            await Task.Run(() => ShowAllElementsBlue(elements));
         }
 
-        private void ShowAllGreen(int[] elements)
+        private void ShowAllElementsBlue(int[] elements)
         {
             if (threadDelay == 200)
             {

SortingAlgorithmVisualisation/Algorithms/AlgorithmBase.cs

@@ -0,0 +1,99 @@
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Runtime.InteropServices;
+using System.Text;
+using System.Threading.Tasks;
+using System.Threading;
+using System.Windows.Forms;
+using System.Drawing;
+
+namespace SortingAlgorithmVisualisation.Algorithms
+{
+    class PancakeSort : AlgorithmBase
+    {
+        public override int elementCount { get; set; }
+        private int sortedIndex;
+
+        public override void BeginAlgorithm(int[] elements)
+        {
+            StartPancakeSort(elements);
+        }
+
+        private void StartPancakeSort(int[] elements)
+        {
+            for(int i = elementCount; i > 1; i--)
+            {
+                int maxIndex = FindMaxIndex(elements, i); //Returns the index of the highest value within a range
+                sortedIndex = i;
+
+                if(maxIndex != i)
+                {
+                    FlipArray(elements, maxIndex); //Flips to the highest index so that [0] is the highest value
+                    FlipArray(elements, i - 1); //Flips to make the highest value that was [0] to [i - 1]
+                }
+            }
+        }
+
+        private int FindMaxIndex(int[] elements, int upperLimit)
+        {
+            int maxIndex = 0;
+            int highestValue = 0;
+
+            for(int i = 0; i < upperLimit; i++)
+            {
+                if(elements[i] > highestValue)
+                {
+                    maxIndex = i;
+                    highestValue = elements[i];
+                }
+            }
+
+            return maxIndex;
+        }
+
+        private void FlipArray(int[] elements, int upperLimit)
+        {
+            int upperIndex = upperLimit;
+            
+            for(int i = 0; i < upperLimit; i++)
+            {
+                int temp = elements[upperIndex];
+                elements[upperIndex] = elements[i];
+                elements[i] = temp;
+                upperIndex--;
+            }
+
+            ReDrawDisplay(elements);
+        }
+
+        private void ClearDisplay()
+        {
+            for (int i = 0; i < sortedIndex; i++)
+            {
+                graphics.FillRectangle(new SolidBrush(SystemColors.ActiveBorder), i * maxWidth, 0, maxWidth, maxHeight);
+            }
+        }
+
+        private void ReDrawDisplay(int[] elements)
+        {
+            ClearDisplay();
+
+            if (threadDelay == 200)
+            {
+                threadDelay = 80;
+            }
+            else if (threadDelay == 0)
+            {
+                threadDelay = 1;
+            }
+
+            for (int i = 0; i < sortedIndex; i++)
+            {
+                graphics.FillRectangle(new SolidBrush(Color.Black), i * maxWidth, maxHeight - elements[i], maxWidth, elements[i]);
+            }
+
+            Thread.Sleep(threadDelay + 20);
+        }
+    }
+}

SortingAlgorithmVisualisation/Algorithms/PancakeSort.cs

@@ -26,7 +26,6 @@ private void StartRadixSort(int[] elements)
             {
                 Thread.Sleep(700);
 
-                ClearDisplay();
                 CountSort(elements, i);
 
                 //Redraw all elements
@@ -85,6 +84,8 @@ private void ClearDisplay()
 
         private void ReDrawDisplay(int[] elements)
         {
+            ClearDisplay();
+
             if (threadDelay == 200)
             {
                 threadDelay = 80;
@@ -98,6 +99,7 @@ private void ReDrawDisplay(int[] elements)
             {
                 graphics.FillRectangle(new SolidBrush(Color.Black), i * maxWidth, maxHeight - elements[i], maxWidth, elements[i]);
                 Thread.Sleep(threadDelay);
+               // MessageBox.Show(elements[i].ToString());
             }
         }
     }

SortingAlgorithmVisualisation/Algorithms/RadixSort.cs

@@ -97,6 +97,10 @@ private void SetUpFormData(string _setModifier)
             {
                 secondDelay.Text += threadDelay + 220 + "ms";
             }
+            else if (algorithmName.Contains("Pancake"))
+            {
+                secondDelay.Text += threadDelay + 20 + "ms";
+            }
             else
             {
                 secondDelay.Text += threadDelay + "ms";

SortingAlgorithmVisualisation/Forms/DisplaySort.cs

@@ -140,6 +140,10 @@ private bool SetAlgorithmData()
                     algorithm = new TreeSort();
                     algorithm.SetComplexity(2);
                     break;
+                case "Pancake Sort":
+                    algorithm = new PancakeSort();
+                    algorithm.SetComplexity(4);
+                    break;
                 case null:
                     MessageBox.Show("Please select an algorithm","Error");
                     return false;

SortingAlgorithmVisualisation/Forms/MainMenuForm.Designer.cs

@@ -25,7 +25,7 @@
     <TargetCulture>en</TargetCulture>
     <ProductName>Sorting Algorithm Visualiser</ProductName>
     <PublisherName>Nathan Jukes</PublisherName>
-    <ApplicationRevision>7</ApplicationRevision>
+    <ApplicationRevision>8</ApplicationRevision>
     <ApplicationVersion>1.0.0.%2a</ApplicationVersion>
     <UseApplicationTrust>false</UseApplicationTrust>
     <PublishWizardCompleted>true</PublishWizardCompleted>
@@ -87,6 +87,7 @@
     <Compile Include="Algorithms\InsertionSort.cs" />
     <Compile Include="Algorithms\MergeSort.cs" />
     <Compile Include="Algorithms\OddEvenSort.cs" />
+    <Compile Include="Algorithms\PancakeSort.cs" />
     <Compile Include="Algorithms\QuickSort.cs" />
     <Compile Include="Algorithms\RadixSort.cs" />
     <Compile Include="Algorithms\SelectionSort.cs" />