AlgorithmLab3/src/Sorting.java at master · suwaiyeeaung/AlgorithmLab3 · 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
import java.util.Scanner;

public class Sorting {
	public static void main(String args[])
    {

		InsertionSort ob = new InsertionSort();
        MergeSort mob = new MergeSort();


	        int opt=0;
	        Scanner sc = new Scanner(System.in);


	        while (opt != 4){

	    	    System.out.println("1. for random numbers\n2. for ascending\n3. for descending\n4. Quit\nPlease enter your choice:");
		        opt = sc.nextInt();
		        int insArr[] =  list(opt);


		        ob.insNumOfComp = 0;
		        mob.numOfComp = 0;

		        int mergeArr[] = insArr;

		        System.out.println("Original Array...");
		        //printArray(insArr);

		        long insStartTime = System.nanoTime();
		        ob.insertionSort(insArr);
		        long insEndTime = System.nanoTime();
		    	System.out.println("Insertion Sort Took "+(insEndTime - insStartTime) + " ns");

		        long merStartTime = System.nanoTime();
		        mob.mergeSort(mergeArr,0,mergeArr.length-1);
		        long merEndTime = System.nanoTime();
		        System.out.println("Merge Sort Took "+(merEndTime - merStartTime) + " ns");

		        System.out.println("Insertion Sort: Sorted Array...");
		        //printArray(insArr);
		        System.out.println("Number of Comparisons = " + ob.insNumOfComp);
		        System.out.println("Merge Sort: Sorted Array...");
		        //printArray(mergeArr);
		        System.out.println("Number of Comparisons = " + mob.numOfComp);

	       };

    }


    public static int[] list(int opt) {


    	int n = 1000;
        int[] anArray = new int[n];


        for(int i=0;i<anArray.length;i++)
        {
        	switch(opt) {
	        	case 1:
	        		anArray[i] = (int) (Math.random()*10*n); //random
	        		break;
	        	case 2:
	        		anArray[i] = i; // ascending
	        		break;
	        	case 3:
	        		anArray[i] = n - i; //descending
	        		break;
	        	default:
	        		break;
        	}
        }
        return anArray;
    }

        static void printArray(int arr[])
        {
            int n = arr.length;
            for (int i=0; i<n; ++i)
                System.out.print(arr[i] + " ");
            System.out.println();
        }

}