Last active
November 23, 2017 11:31
-
-
Save mkdika/4b58dcb7b9538d50e53cb27f2cb9fde5 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.Arrays; | |
| /** | |
| * | |
| * @author Maikel Chandika <mkdika@gmail.com> | |
| */ | |
| public class BubbleSortArrayType { | |
| public static void main(String[] args) { | |
| String[] dataString = {"Jack Man", "Budi Man", "Andy Gunawan", "Denny Tejo", | |
| "Sofyan", "Fendy Agus"}; | |
| int[] dataInt = {3, 4, 1, 5, 8, 9, 2, 6, 10, 7}; | |
| double[] dataDouble = {4.56, 2.95, 5.34, 3.1, 2.3, 1.2, 1.3, 4.77, 3.09}; | |
| System.out.println("String Sort"); | |
| System.out.println("Before: " + Arrays.toString(dataString)); | |
| System.out.println("After: " + Arrays.toString(bsortString(dataString))); | |
| System.out.println(); | |
| System.out.println("Integer Sort"); | |
| System.out.println("Before: " + Arrays.toString(dataInt)); | |
| System.out.println("After: " + Arrays.toString(bsortInteger(dataInt))); | |
| System.out.println(); | |
| System.out.println("Double Sort"); | |
| System.out.println("Before: " + Arrays.toString(dataDouble)); | |
| System.out.println("After: " + Arrays.toString(bsortDouble(dataDouble))); | |
| } | |
| static String[] bsortString(String[] arrs) { | |
| String temp; | |
| for (int i = 0; i < arrs.length-1; i++) { | |
| for (int j = 0; j < arrs.length-1; j++) { | |
| if (arrs[j].compareTo(arrs[j + 1]) > 0) { | |
| temp = arrs[j]; | |
| arrs[j] = arrs[j + 1]; | |
| arrs[j + 1] = temp; | |
| } | |
| } | |
| } | |
| return arrs; | |
| } | |
| static int[] bsortInteger(int[] arrs) { | |
| int temp; | |
| for (int i = 0; i < arrs.length-1; i++) { | |
| for (int j = 0; j < arrs.length-1; j++) { | |
| if (arrs[j] > arrs[j + 1]) { | |
| temp = arrs[j]; | |
| arrs[j] = arrs[j + 1]; | |
| arrs[j + 1] = temp; | |
| } | |
| } | |
| } | |
| return arrs; | |
| } | |
| static double[] bsortDouble(double[] arrs) { | |
| double temp; | |
| for (int i = 0; i < arrs.length-1; i++) { | |
| for (int j = 0; j < arrs.length-1; j++) { | |
| if (arrs[j] > arrs[j + 1]) { | |
| temp = arrs[j]; | |
| arrs[j] = arrs[j + 1]; | |
| arrs[j + 1] = temp; | |
| } | |
| } | |
| } | |
| return arrs; | |
| } | |
| } | |
| /* Runtime Output: | |
| String Sort | |
| Before: [Jack Man, Budi Man, Andy Gunawan, Denny Tejo, Sofyan, Fendy Agus] | |
| After: [Andy Gunawan, Budi Man, Denny Tejo, Fendy Agus, Jack Man, Sofyan] | |
| Integer Sort | |
| Before: [3, 4, 1, 5, 8, 9, 2, 6, 10, 7] | |
| After: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] | |
| Double Sort | |
| Before: [4.56, 2.95, 5.34, 3.1, 2.3, 1.2, 1.3, 4.77, 3.09] | |
| After: [1.2, 1.3, 2.3, 2.95, 3.09, 3.1, 4.56, 4.77, 5.34] | |
| */ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment