GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Sorts/ShellSort.java at master · feinoah/Java Expand file tree/ Copy pathShellSort.javaMore file actions 50 lines (38 loc) · 948 Bytes / Copy pathShellSort.javaFile metadata and controls50 lines (38 loc) · 948 Bytes 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 package Sorts; import static Sorts.SortUtils.*; /** * @author dpunosevac * @author Podshivalov Nikita (https://github.com/nikitap492) * * @see SortAlgorithm * */ public class ShellSort implements SortAlgorithm { /** * This method implements Generic Shell Sort. * @param array The array to be sorted */ @Override public <T extends Comparable<T>> T[] sort(T[] array) { int N = array.length; int h = 1; while (h < N/3) { h = 3 * h + 1; } while (h >= 1) { for (int i = h; i < N; i++) { for (int j = i; j >= h && less(array[j], array[j-h]); j -= h) { swap(array, j, j - h); } } h /= 3; } return array; } public static void main(String[] args) { Integer[] toSort = {4, 23, 6, 78, 1, 54, 231, 9, 12}; ShellSort sort = new ShellSort(); Integer[] sorted = sort.sort(toSort); print(sorted); } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |