@@ -0,0 +1,809 @@
+public class HybridSort %7B%0A%0A    private static final int number = 154; // use insertion sort if size %3C number%0A%0A    public static void hybridSort(int%5B%5D arr, int start, int end) %7B%0A        if ( end - start %3C number) %7B%0A            insertionSort(arr, start, end);%0A        %7D else %7B%0A            if (start %3C end) %7B%0A                int part = QuickSort.partition(arr, start, end);%0A                hybridSort(arr, start, part - 1);%0A                hybridSort(arr, part + 1, end);%0A            %7D%0A        %7D%0A    %7D%0A%0A    private static void insertionSort(int%5B%5D arr, int start, int end) %7B%0A        for (int i = start; i %3C= end; i++) %7B%0A            int tmp = arr%5Bi%5D;%0A            for (int j = i - 1; j %3E= 0 && tmp %3C arr%5Bj%5D ; j-- ) %7B%0A                arr%5Bj+1%5D = arr%5Bj%5D;%0A                arr%5Bj%5D = tmp ;%0A            %7D%0A        %7D%0A    %7D%0A%7D%0A

Add hybrid sort java implementation