SortingTechniques/Sorting.java at master · jayamrutkar/SortingTechniques · 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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
package geeks.algo.sort;

import java.util.Arrays;
import java.util.Scanner;

public class Sorting {

	public enum SortType{
		BUBBLE_SORT, SELECTION_SORT, INSERTION_SORT, MERGE_SORT, QUICK_SORT, HEAP_SORT, COUNTING_SORT,
		RADIX_SORT, BUCKET_SORT, SHELL_SORT, PIGEONHOLE_SORT
	}

	private Sort sort;
	private SortType sortType;

	int[] arr;

	public Sorting() {
		super();
		this.sortType = SortType.MERGE_SORT;
	}

	void setSortingWay(Sort sort){
		this.sort=sort;
	}

	void captureInputs(){
		Scanner in = new Scanner(System.in);

		System.out.println("How many: ");
		int n = in.nextInt();

		System.out.println("Enter elements: ");
		arr = new int[n];
		for(int i=0;i<n;i++){
			arr[i]= in.nextInt();
		}

		System.out.println("Different Sorting Available Options: ");
		int i=0;
		for(i=0;i<SortType.values().length;i++){
			System.out.println((i+1)+". "+SortType.values()[i]);
		}
		System.out.println((i+1)+". Exit");
		System.out.println("Select Sorting Technique ");
		int selected = in.nextInt();

		if(selected>0 && selected<=SortType.values().length){
			this.sortType = SortType.values()[selected-1];
		}

		in.close();
	}

	void task(){

		//Capture input elements
		captureInputs();

		//New Array Here
		int[] localArr = Arrays.copyOf(this.arr, this.arr.length);

		switch(this.sortType){
		case BUBBLE_SORT:
			setSortingWay(new BubbleSort(localArr));
			break;
		case SELECTION_SORT:
			setSortingWay(new SelectionSort(localArr));
			break;
		case INSERTION_SORT:
			setSortingWay(new InsertionSort(localArr));
			break;
		case MERGE_SORT:
			setSortingWay(new MergeSort(localArr));
			break;
		case QUICK_SORT:
			setSortingWay(new QuickSort(localArr));
			break;
		case HEAP_SORT:
			setSortingWay(new HeapSort(localArr));
			break;
		case COUNTING_SORT:
			setSortingWay(new CountingSort(localArr));
			break;
		case RADIX_SORT:
			setSortingWay(new RadixSort(localArr));
			break;
		case BUCKET_SORT:
			setSortingWay(new BucketSort(localArr));
			break;
		case SHELL_SORT:
			setSortingWay(new ShellSort(localArr));
			break;
		case PIGEONHOLE_SORT:
			setSortingWay(new PigeonholeSorting(localArr));
			break;
		default:
			setSortingWay(new MergeSort(localArr));
		}
		this.sort.performTask();

	}

	public static void main(String[] args) {

		Sorting sorting = new Sorting();
		sorting.task();

	}

}