public void CountingSort(SortStore s)
{
int max = s[0];
for (int i = 0; i < s.Array.Length; i++)
{
if (s[i] > max)
{
max = s[i];
}
}
int[] counts = new int[max + 1];
for (int i = 0; i < s.Array.Length; i++)
{
counts[s[i]]++;
}
int j = 0;
for (int i = 0; i < counts.Length; i++)
{
while (counts[i] > 0)
{
s[j] = i;
j++;
counts[i]--;
}
}
}
public void ShellSort(SortStore s)
{
int j, temp = 0;
int increment = (s.Array.Length) / 2;
while (increment > 0)
{
for (int index = 0; index < s.Array.Length; index++)
{
j = index;
temp = s[index];
while ((j >= increment) && s[j - increment] > temp)
{
s[j] = s[j - increment];
j = j - increment;
}
s[j] = temp;
}
if (increment / 2 != 0)
{
increment = increment / 2;
}
else if (increment == 1)
{
increment = 0;
}
else
{
increment = 1;
}
}
}
public void CocktailSort(SortStore s)
{
for (int k = s.Array.Length - 1; k > 0; k--)
{
bool swapped = false;
for (int i = k; i > 0; i--)
{
if (s[i] < s[i - 1])
{
int temp = s[i];
s[i] = s[i - 1];
s[i - 1] = temp;
swapped = true;
}
}
for (int i = 0; i < k; i++)
{
if (s[i] > s[i + 1])
{
int temp = s[i];
s[i] = s[i + 1];
s[i + 1] = temp;
swapped = true;
}
}
if (!swapped)
{
break;
}
}
}
//Here we place pictureboxes with heights mapped to math array.
public void ViewInit(Form form, SortStore store)
{
picArray = new PictureBox[Globals.arraySize];
SortStore s = store;
for (int i = 0; i < s.Array.Length; i++)
{
picArray[i] = new PictureBox();
picArray[i].Size = new Size(Globals.frameSize, s.Array[i]);
picArray[i].BackColor = Color.FromArgb(0, 0, 0);
picArray[i].Visible = true;
picArray[i].Location = new Point(i * Globals.frameSize, 20);
picArray[i].Name = i.ToString();
form.Controls.Add(picArray[i]);
form.Update();
}
}
public void LooksLikeBubbleSort(SortStore s)
{
int buffer = 0;
for (int m = 0; m <= s.Array.Length - 2; m++)
{
for (int i = m + 1; i <= s.Array.Length - 2; i++)
{
if (s[m] > s[i])
{
buffer = s[m];
s[m] = s[i];
s[i] = buffer;
}
}
}
}
//Given "s" as array object, we simply need to sort it without thinking about view logic
//There is some conventions:
//Must use .Array.Lenght if we need array lenght.
//Also you cannot use array-specific code such as CopyTo, you have only indexes and values. Implement specfic code manaually.
//Or implement array methods in SortStore class.
public void BubbleSort(SortStore s)
{
int buffer = 0;
for (int m = 0; m <= s.Array.Length - 2; m++)
{
for (int i = 0; i <= s.Array.Length - 2; i++)
{
if (s[i] > s[i + 1])
{
buffer = s[i + 1];
s[i + 1] = s[i];
s[i] = buffer;
}
}
}
}
public void InsertionSort(SortStore s)
{
for (int i = 0; i < s.Array.Length - 1; i++)
{
int j = i + 1;
while (j > 0)
{
if (s[j - 1] > s[j])
{
int temp = s[j - 1];
s[j - 1] = s[j];
s[j] = temp;
}
j--;
}
}
}
public void RadixSort(SortStore s)
{
int[] t = new int[s.Array.Length];
int r = 4;
int b = 32;
int[] count = new int[1 << r];
int[] pref = new int[1 << r];
int groups = (int)Math.Ceiling((double)b / (double)r);
int mask = (1 << r) - 1;
for (int c = 0, shift = 0; c < groups; c++, shift += r)
{
for (int j = 0; j < count.Length; j++)
{
count[j] = 0;
}
for (int i = 0; i < s.Array.Length; i++)
{
count[(s[i] >> shift) & mask]++;
}
pref[0] = 0;
for (int i = 1; i < count.Length; i++)
{
pref[i] = pref[i - 1] + count[i - 1];
}
for (int i = 0; i < s.Array.Length; i++)
{
t[pref[(s[i] >> shift) & mask]++] = s[i];
}
// Instead of t.CopyTo(s, 0);
foreach (int i in t)
{
s[i] = t[i];
}
}
}
public void GnomeSort(SortStore s)
{
for (int i = 1, temp_value; i < s.Array.Length;)
{
if (s[i - 1] <= s[i])
{
i += 1;
}
else
{
temp_value = s[i - 1];
s[i - 1] = s[i];
s[i] = temp_value;
i -= 1;
if (i == 0)
{
i = 1;
}
}
}
}
private void button1_Click(object sender, EventArgs e)
{
//Destroy running math thread and clean up all pictures
CleanUp();
//There was dilhemma - to use new class instaces every time, or use singletons and static classes.
//I choose new classes, actually there are already exists Globals class, so I don't want to create more global classes.
SortView v = new SortView();
SortStore s = new SortStore();
SortMath m = new SortMath();
if (cbSortSelector.Text == "Bubble sort")
{
Globals.arraySize = 250;
Globals.frameSize = 4;
//we need separate thread for non UI blocking sort
Globals.MathThread = new Thread(() => { m.BubbleSort(s); });
}
if (cbSortSelector.Text == "Not so bubble sort")
{
Globals.arraySize = 250;
Globals.frameSize = 4;
Globals.MathThread = new Thread(() => { m.LooksLikeBubbleSort(s); });
}
if (cbSortSelector.Text == "Radix sort")
{
Globals.arraySize = 300;
Globals.frameSize = 3;
Globals.MathThread = new Thread(() => { m.RadixSort(s); });
}
if (cbSortSelector.Text == "Insertion sort")
{
Globals.arraySize = 200;
Globals.frameSize = 4;
Globals.MathThread = new Thread(() => { m.InsertionSort(s); });
}
if (cbSortSelector.Text == "Counting sort")
{
Globals.arraySize = 400;
Globals.frameSize = 2;
Globals.MathThread = new Thread(() => { m.CountingSort(s); });
}
if (cbSortSelector.Text == "Cocktail sort")
{
Globals.arraySize = 200;
Globals.frameSize = 3;
Globals.MathThread = new Thread(() => { m.CocktailSort(s); });
}
if (cbSortSelector.Text == "Shell sort")
{
Globals.arraySize = 200;
Globals.frameSize = 3;
Globals.MathThread = new Thread(() => { m.ShellSort(s); });
}
if (cbSortSelector.Text == "Gnome sort")
{
Globals.arraySize = 200;
Globals.frameSize = 3;
Globals.MathThread = new Thread(() => { m.GnomeSort(s); });
}
if (cbrand.Checked == true)
{
s.StoreInitRandom();
}
else
{
s.StoreInitSorted();
}
v.ViewInit(this, s);
//connect store class with view class, while store class will be changed by math class
s.ValueChanged += v.ViewUpdate;
s.ValueAccessed += v.ViewUpdate;
if (Globals.MathThread != null)
{
Globals.MathThread.Start();
}
}
