/* if you find it difficult when you run this program, i highly recommended to run this program in your beloved IDE or your text editor, good luck pal, cheers :v */ public class threeOptions { public static void main(String... Naufal) { java.util.Scanner input = new java.util.Scanner(System.in); int A[][] = new int[2][3]; int B[][] = new int[3][2]; int C[][] = new int[2][2]; char repeat = 'Y'; int choice; for (; repeat == 'Y' || repeat == 'y';) { System.out.print("~~~~~~~~~~~~~~~ COLLEGE ASSIGNMENT ~~~~~~~~~~~~~~~ \n"); System.out.print("~~~~~~~~~~~~~~~~~~~~~~~ HN ~~~~~~~~~~~~~~~~~~~~~~~ \n"); System.out.print("Choose one from the following options: \n"); System.out.print("1. Matrix multiplication (2x3 with 3x2) \n"); System.out.print("2. Insertion sort & quick sort (descending) \n"); System.out.print("3. Linier & binary Search \n"); System.out.print("~~~~~~~~~~~~~~~~~~~~~~~ 2K18 ~~~~~~~~~~~~~~~~~~~~~ \n"); System.out.println(); System.out.print("Input your choice = "); choice = input.nextInt(); System.out.print("\n"); switch (choice) { //block program of number 1 case 1: System.out.print("Input data of matrix A (2x3): \n"); for (int i = 0; i < 2;) { int j = 0; do { System.out.print("(" + (1 + i) + "," + (1 + j) + ")" + " : "); A[i][j] = input.nextInt(); j++; } while (j < 3); System.out.print("\n"); i = i + 1; } System.out.print("\n"); System.out.print("Input data of matrix B (3x2): \n"); for (int i = 0; i < 3;) { int j = 0; do { System.out.print("(" + (1 + i) + "," + (1 + j) + ")" + " : "); B[i][j] = input.nextInt(); j++; } while (j < 2); System.out.print("\n"); i = i + 1; } for (int i = 0; i < 2; i++) { int j = 0; while (j < 2) { int k = 0; for (; k < 3;) { C[i][j] += A[i][k] * B[k][j]; k = k + 1; } j += 1; } } System.out.print("The result of multiplication: \n"); for (int[] row : C) { for (int column : row) { System.out.print(column + " "); } System.out.print("\n"); } break; //the end of program number 1 //block program of number 2 case 2: System.out.print("Input the number of data: "); int d = input.nextInt(); int data[] = new int[d]; int n = data.length; System.out.print("\n"); System.out.print("Input " + n + " data: \n"); for (int i = 0; n > i;) { System.out.print("Value of data-" + (i + 1) + " : "); data[i] = input.nextInt(); i += 1; } System.out.print("\n"); System.out.println("The data that will be sorted: "); for (int a = 0; n > a;) { System.out.print(data[a] + " "); a = a + 1; } System.out.print("\n"); System.out.print("\n"); System.out.print("~~~~~~~Insertion Sort~~~~~~~ \n"); System.out.print("The data that already sorted: \n"); for (int i = 0; i < n - 1; i++) { int a = i + 1; int tmp = data[a]; while (a > 0 && tmp > data[a - 1]) { data[a] = data[a - 1]; a--; } data[a] = tmp; } for (int a = 0; n > a;) { System.out.print(data[a] + " "); ++a; } System.out.print("\n"); System.out.print("\n"); System.out.print("~~~~~~~~~Quick Sort~~~~~~~~~ \n"); System.out.print("The data that already sorted: \n"); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (data[i] < data[j]) { int temp = data[i]; data[i] = data[j]; data[j] = temp; } } } for (int i = 0; i < n - 1; i++) { System.out.print(data[i] + " "); } System.out.print(data[n - 1]); System.out.print("\n"); break; //the end of program number 2 //block program of number 3 case 3: int data3[], sum, search, insert, n2, first, middle, last; System.out.print("Input the number of data: "); insert = input.nextInt(); data3 = new int[insert]; n2 = data3.length; System.out.print("input " + insert + " Data: \n"); sum = 0; while (sum < insert) { System.out.print("Value of data-" + (1 + sum) + " = "); data3[sum] = input.nextInt(); sum = sum + 1; } System.out.print("\n"); System.out.print("Enter the value that you are looking for: "); search = input.nextInt(); sum = 0; System.out.print("\n"); System.out.print("~~~~~Linier Search~~~~~ \n"); System.out.println("The data that entered: "); for (int a = 0; n2 > a;) { System.out.print(data3[a] + " "); a = a + 1; } System.out.print("\n"); System.out.print("\n"); while (insert > sum) { if (data3[sum] == search) { System.out.println(search + " is at index-" + (1 + sum)); break; } sum += 1; } if (sum == insert) { System.out.println(search + " is didn't find at any index!!!"); } System.out.print("\n"); System.out.print("~~~~~Binary Search~~~~~ \n"); System.out.print("The data that already sorted: \n"); int tmp; for (int a = 1; n2 > a; a++) { tmp = data3[a]; int position = a; for (int b = 0; a > b; b++) { if (tmp < data3[b]) { position = b; for (int c = a; position < c;) { data3[c] = data3[c - 1]; c -= 1; } break; } } data3[position] = tmp; } for (int a = 0; n2 > a;) { System.out.print(data3[a] + " "); ++a; } System.out.print("\n"); System.out.print("\n"); first = 0; last = n2 - 1; middle = (first + last) / 2; while (first <= last) { if (data3[middle] < search) { first = middle + 1; } else if (data3[middle] == search) { System.out.print(search + " is at index-" + (1 + middle)); break; } else { last = middle - 1; } middle = (first + last) / 2; } if (first > last) { System.out.print(search + " is didn't find at any index!!!"); } System.out.print("\n"); break; //the end of program number 3 default: System.out.print("Your input is invalid!!! \n"); break; } System.out.print("\n"); System.out.print("~~~~~~~~~~~~~~~~~~~END OF PROGRAM~~~~~~~~~~~~~~~~~~~ \n"); System.out.print("\n"); System.out.print("Do you want to return in the main menu ? [Y/N] = "); repeat = input.next().charAt(0); System.out.print("\n"); } } }

Multiple options