forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathShellSort.java
More file actions
65 lines (57 loc) · 1.58 KB
/
Copy pathShellSort.java
File metadata and controls
65 lines (57 loc) · 1.58 KB
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
/**
*
* @author Kriztoper Urmeneta (https://github.com/Kriztoper)
*
*/
class ShellSort
{
/**
* This method implements the Generic Shell Sort
*
* @param array The array to be sorted
* @param last The count of total number of elements in array
* Sorts the array in increasing order
**/
public static <T extends Comparable<T>> void SS(T array[], int last) {
for (int gap = last/2; gap > 0; gap /= 2)
{
for (int i = gap, j = 0; i < last; i++)
{
T temp = array[i];
for (j = i; (j >= gap) && (array[j - gap].compareTo(temp) > 0); j -= gap)
{
array[j] = array[j - gap];
}
array[j] = temp;
}
}
}
// Driver Program
public static void main(String[] args)
{
// Integer Input
int[] arr1 = {4,23,6,78,1,54,231,9,12};
int last = arr1.length;
Integer[] array = new Integer[last];
for (int i=0;i<last;i++) {
array[i] = arr1[i];
}
SS(array, last);
// Output => 1 4 6 9 12 23 54 78 231
for(int i=0; i<last; i++)
{
System.out.print(array[i]+"\t");
}
System.out.println();
// String Input
String[] array1 = {"c", "a", "e", "b","d"};
last = array1.length;
SS(array1, last);
//Output => a b c d e
for(int i=0; i<last; i++)
{
System.out.print(array1[i]+"\t");
}
System.out.println();
}
}