Sort-Analysis/CountingRandomSort.java at master · andrewzung/Sort-Analysis · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/*
 * Class:  CountingRandomSort
 * Author:  Andrew Zung
 * Date: Nov 13, 2014
 *
 * Description:
 *   The main class to run the various methods required for the sorting.
 */


import java.util.*;

public class CountingRandomSort
{
  public static void main(String[] args)
  {
    for (int i = 10; i<100001; i=i*10)
    {
      int totalCompare = 0;
      int totalSwaps = 0;
      for (int j = 0; j<10; j++)
      {
        int[] list = ArrayGen.randomizedArray(i);
        ModifiedSorts.compare= 0;
        ModifiedSorts.swaps = 0;
        ModifiedSorts.selectSort(list);
        totalCompare += ModifiedSorts.compare;
        totalSwaps += ModifiedSorts.swaps;
      }
      totalCompare = totalCompare/10;
      totalSwaps = totalSwaps/10;
      System.out.println("The comparisons and swaps for a random array of " + i + " items using a Select Sort is : " + totalCompare +" and "+ totalSwaps);

      totalCompare = 0;
      totalSwaps = 0;
      for (int j = 0; j<10; j++)
      {
        int[] list = ArrayGen.randomizedArray(i);
        ModifiedSorts.compare= 0;
        ModifiedSorts.swaps = 0;
        ModifiedSorts.bubbleSort(list);
        totalCompare += ModifiedSorts.compare;
        totalSwaps += ModifiedSorts.swaps;
      }
      totalCompare = totalCompare/10;
      totalSwaps = totalSwaps/10;
      System.out.println("The comparisons and swaps for a random array of " + i + " items using a Bubble Sort is : " + totalCompare +" and "+ totalSwaps);

      totalCompare = 0;
      totalSwaps = 0;
      for (int j = 0; j<10; j++)
      {
        int[] list = ArrayGen.randomizedArray(i);
        ModifiedSorts.compare= 0;
        ModifiedSorts.swaps = 0;
        ModifiedSorts.insertSort(list);
        totalCompare += ModifiedSorts.compare;
        totalSwaps += ModifiedSorts.swaps;
      }
      totalCompare = totalCompare/10;
      totalSwaps = totalSwaps/10;
      System.out.println("The comparisons and swaps for a random array of " + i + " items using a Insert Sort is : " + totalCompare +" and "+ totalSwaps);

      totalCompare = 0;
      totalSwaps = 0;
      for (int j = 0; j<10; j++)
      {
        int[] list = ArrayGen.randomizedArray(i);
        ModifiedSorts.compare= 0;
        ModifiedSorts.swaps = 0;
        ModifiedSorts.mergeSort(list);
        totalCompare += ModifiedSorts.compare;
        totalSwaps += ModifiedSorts.swaps;
      }
      totalCompare = totalCompare/10;
      totalSwaps = totalSwaps/10;
      System.out.println("The comparisons and swaps for a random array of " + i + " items using a Merge Sort is : " + totalCompare +" and "+ totalSwaps);

      totalCompare = 0;
      totalSwaps = 0;
      for (int j = 0; j<10; j++)
      {
        int[] list = ArrayGen.randomizedArray(i);
        ModifiedSorts.compare= 0;
        ModifiedSorts.swaps = 0;
        ModifiedSorts.quickSort(list);
        totalCompare += ModifiedSorts.compare;
        totalSwaps += ModifiedSorts.swaps;
      }
      totalCompare = totalCompare/10;
      totalSwaps = totalSwaps/10;
      System.out.println("The comparisons and swaps for a random array of " + i + " items using a Quick Sort is : " + totalCompare +" and "+ totalSwaps);
    }
  }
}