|
| 1 | +import java.util.Scanner; |
| 2 | +public class Arrays_1D { |
| 3 | + public static void main(String[] args) { |
| 4 | + // TODO: Example_1 |
| 5 | + double[] prices = new double[5]; |
| 6 | + prices[0] = 23.5; |
| 7 | + prices[1] = 33.0; |
| 8 | + System.out.println(prices[0]); |
| 9 | +/* ------------------------------------------------------- */ |
| 10 | + // TODO: Example_2 |
| 11 | + String[] cars = {"BMW", "Mercedes", "Tesla", "Nissan", "Toyota"}; |
| 12 | + System.out.println(cars[2]); |
| 13 | + cars[0] = "Ford";// index 0 changed |
| 14 | + System.out.println(cars[0]); |
| 15 | + System.out.println(cars[5]); //index out of range |
| 16 | + for(int i=0;i<cars.length; i++){ |
| 17 | + System.out.println(cars[i]); |
| 18 | + } |
| 19 | + //foreach or enhanced for |
| 20 | + for(String x : cars){ |
| 21 | + System.out.println(x); |
| 22 | + } |
1 | 23 |
|
| 24 | +/* ------------------------------------------------------- */ |
| 25 | + // TODO: Example_3: sum array elements |
| 26 | + int[] numbers = {11, 22, 35, 41, 55}; |
| 27 | + int sum = 0; |
| 28 | + for (int i = 0; i < numbers.length; i++) { |
| 29 | + sum += numbers[i]; |
| 30 | + } |
| 31 | + System.out.println("Sum of elements: " + sum); |
| 32 | + |
| 33 | +/* ------------------------------------------------------- */ |
| 34 | + // TODO: Example_4: Finding the Maximum Element |
| 35 | + int[] nums = {8, 3, 11, 5, 2}; |
| 36 | + int max = nums[0]; |
| 37 | + for (int i = 1; i < nums.length; i++) { |
| 38 | + if (nums[i] > max) { |
| 39 | + max = nums[i]; |
| 40 | + } |
| 41 | + } |
| 42 | + System.out.println("Maximum element: " + max); |
| 43 | + |
| 44 | +/* ------------------------------------------------------- */ |
| 45 | + // TODO: Example_5: Checking for Even Numbers |
| 46 | + int[] numbers_1 = {1, 2, 3, 4, 5}; |
| 47 | + for (int i = 0; i < numbers_1.length; i++) { |
| 48 | + if (numbers_1[i] % 2 == 0) { |
| 49 | + System.out.println(numbers_1[i] + " is even."); |
| 50 | + } |
| 51 | + } |
| 52 | + |
| 53 | +/* ------------------------------------------------------- */ |
| 54 | + // TODO: Example_6: Counting Positive and Negative Numbers |
| 55 | + int[] numbers_2 = {-1, 2, -3, 4, -5}; |
| 56 | + int positiveCount = 0; |
| 57 | + int negativeCount = 0; |
| 58 | + for (int i = 0; i < numbers_2.length; i++) { |
| 59 | + if (numbers_2[i] > 0) { |
| 60 | + positiveCount++; |
| 61 | + } else if (numbers_2[i] < 0) { |
| 62 | + negativeCount++; |
| 63 | + } |
| 64 | + } |
| 65 | + System.out.println("Positive numbers: " + positiveCount); |
| 66 | + System.out.println("Negative numbers: " + negativeCount); |
| 67 | + |
| 68 | +/* ------------------------------------------------------- */ |
| 69 | + // TODO: Example_7: Reversing an Array |
| 70 | + int[] numbers_3 = {1, 2, 3, 4, 5}; |
| 71 | + int[] reversed = new int[numbers_3.length]; |
| 72 | + for (int i = 0; i < numbers_3.length; i++) { |
| 73 | + reversed[i] = numbers_3[numbers_3.length - 1 - i]; |
| 74 | + } |
| 75 | + System.out.print("Reversed array: "); |
| 76 | + for (int i = 0; i < reversed.length; i++) { |
| 77 | + System.out.print(reversed[i] + " "); |
| 78 | + } |
| 79 | + System.out.println(); |
| 80 | + |
| 81 | +/* ------------------------------------------------------- */ |
| 82 | + // TODO: Example_8: Counting Duplicates |
| 83 | + int[] numbers_4 = {3, 2, 4, 2, 5, 1, 3}; |
| 84 | + int duplicateCount = 0; |
| 85 | + for (int i = 0; i < numbers_4.length - 1; i++) { |
| 86 | + for (int j = i + 1; j < numbers_4.length; j++) { |
| 87 | + if (numbers_4[i] == numbers_4[j]) { |
| 88 | + duplicateCount++; |
| 89 | + break; |
| 90 | + } |
| 91 | + } |
| 92 | + } |
| 93 | + System.out.println("Number of duplicates: " + duplicateCount); |
| 94 | + |
| 95 | +/* ------------------------------------------------------- */ |
| 96 | + // TODO: Example_9: Finding the Average |
| 97 | + int[] numbers_5 = {10, 20, 30, 40, 50}; |
| 98 | + double average; |
| 99 | + int sum_1 = 0; |
| 100 | + for (int num : numbers_5) { |
| 101 | + sum_1 += num; |
| 102 | + } |
| 103 | + average = (double) sum_1 / numbers_5.length; |
| 104 | + System.out.println("Average: " + average); |
| 105 | + |
| 106 | +/* ------------------------------------------------------- */ |
| 107 | + // TODO: Example_10: Finding the Common Elements in Two Arrays |
| 108 | + int[] array1 = {1, 2, 3, 4, 5}; |
| 109 | + int[] array2 = {3, 4, 5, 6, 7}; |
| 110 | + System.out.print("Common elements: "); |
| 111 | + for (int number1 : array1) { |
| 112 | + for (int number2 : array2) { |
| 113 | + if (number1 == number2) { |
| 114 | + System.out.print(number1 + " "); |
| 115 | + break; |
| 116 | + } |
| 117 | + } |
| 118 | + } |
| 119 | + System.out.println(); |
| 120 | + |
| 121 | +/* ------------------------------------------------------- */ |
| 122 | + // TODO: Example_11: Array Rotation (Left Rotation) |
| 123 | + int[] numbers_6 = {1, 2, 3, 4, 5}; |
| 124 | + int rotations_1 = 2; |
| 125 | + for (int r = 0; r < rotations_1; r++) { |
| 126 | + int firstElement = numbers_6[0]; |
| 127 | + |
| 128 | + // Shift elements to the left |
| 129 | + for (int i = 0; i < numbers_6.length - 1; i++) { |
| 130 | + numbers_6[i] = numbers_6[i + 1]; |
| 131 | + } |
| 132 | + // Place the first element at the end |
| 133 | + numbers_6[numbers_6.length - 1] = firstElement; |
| 134 | + } |
| 135 | + System.out.print("Rotated Array: "); |
| 136 | + for (int num : numbers_6) { |
| 137 | + System.out.print(num + " "); |
| 138 | + } |
| 139 | + System.out.println(); |
| 140 | + |
| 141 | +/* ------------------------------------------------------- */ |
| 142 | + // TODO: Example_12: Array Rotation (Right Rotation) |
| 143 | + int[] numbers_7 = {1, 2, 3, 4, 5}; |
| 144 | + int rotations_2 = 2; |
| 145 | + for (int r = 0; r < rotations_2; r++) { |
| 146 | + int lastElement = numbers_7[numbers_7.length - 1]; |
| 147 | + // Shift elements to the right |
| 148 | + for (int i = numbers_7.length - 1; i > 0; i--) { |
| 149 | + numbers_7[i] = numbers_7[i - 1]; |
| 150 | + } |
| 151 | + // Place the last element at the beginning |
| 152 | + numbers_7[0] = lastElement; |
| 153 | + } |
| 154 | + System.out.print("Right Rotated Array: "); |
| 155 | + for (int num : numbers_7) { |
| 156 | + System.out.print(num + " "); |
| 157 | + } |
| 158 | + System.out.println(); |
| 159 | + |
| 160 | +/* ------------------------------------------------------- */ |
| 161 | + // TODO: Example_13: Finding the Difference Between Consecutive Elements |
| 162 | + int[] numbers_8 = {5, 8, 12, 3, 7}; |
| 163 | + int[] differences = new int[numbers_8.length - 1]; |
| 164 | + |
| 165 | + for (int i = 0; i < differences.length; i++) { |
| 166 | + differences[i] = numbers_8[i + 1] - numbers_8[i]; |
| 167 | + } |
| 168 | + System.out.print("Differences Between Consecutive Elements: "); |
| 169 | + for (int diff : differences) { |
| 170 | + System.out.print(diff + " "); |
| 171 | + } |
| 172 | + System.out.println(); |
| 173 | + |
| 174 | +/* ------------------------------------------------------- */ |
| 175 | + // TODO: Example_14: copying an array to another one |
| 176 | + int[] sourceArray = {2, 4, 6, 8, 10}; |
| 177 | + int[] destinationArray = new int[sourceArray.length]; |
| 178 | + |
| 179 | + for (int i = 0; i < sourceArray.length; i++) { |
| 180 | + destinationArray[i] = sourceArray[i]; |
| 181 | + } |
| 182 | + System.out.print("Source Array: "); |
| 183 | + for (int number : sourceArray) { |
| 184 | + System.out.print(number + " "); |
| 185 | + } |
| 186 | + System.out.println(); |
| 187 | + System.out.print("Destination Array: "); |
| 188 | + for (int number : destinationArray) { |
| 189 | + System.out.print(number + " "); |
| 190 | + } |
| 191 | + |
| 192 | +/* ------------------------------------------------------- */ |
| 193 | + // TODO: Example_15: sort array elements |
| 194 | + int[] array = {7, 2, 5, 1, 8, 3}; |
| 195 | + System.out.print("Original Array: "); |
| 196 | + for (int number : array) { |
| 197 | + System.out.print(number + " "); |
| 198 | + } |
| 199 | + System.out.println(); |
| 200 | + // Perform simple sorting without using methods |
| 201 | + for (int i = 0; i < array.length - 1; i++) { |
| 202 | + for (int j = 0; j < array.length - 1 - i; j++) { |
| 203 | + if (array[j] > array[j + 1]) { |
| 204 | + // Swap array[j] and array[j+1] |
| 205 | + int temp = array[j]; |
| 206 | + array[j] = array[j + 1]; |
| 207 | + array[j + 1] = temp; |
| 208 | + } |
| 209 | + } |
| 210 | + } |
| 211 | + System.out.print("Sorted Array: "); |
| 212 | + for (int number : array) { |
| 213 | + System.out.print(number + " "); |
| 214 | + } |
| 215 | + System.out.println(); |
| 216 | + |
| 217 | +/* ------------------------------------------------------- */ |
| 218 | + // TODO: Example_16: differences between two arrays |
| 219 | + int[] array_1 = {5, 8, 12, 6, 10}; |
| 220 | + int[] array_2 = {3, 6, 8, 4, 7}; |
| 221 | + // Calculate the difference and store in the third array |
| 222 | + int[] differenceArray = new int[array_1.length]; |
| 223 | + for (int i = 0; i < array_1.length; i++) { |
| 224 | + differenceArray[i] = array_1[i] - array_2[i]; |
| 225 | + } |
| 226 | + // Display the original arrays |
| 227 | + System.out.print("First Array: "); |
| 228 | + for (int number : array_1) { |
| 229 | + System.out.print(number + " "); |
| 230 | + } |
| 231 | + System.out.println(); |
| 232 | + System.out.print("Second Array: "); |
| 233 | + for (int number : array_2) { |
| 234 | + System.out.print(number + " "); |
| 235 | + } |
| 236 | + System.out.println(); |
| 237 | + // Display the difference array |
| 238 | + System.out.print("Difference Array: "); |
| 239 | + for (int number : differenceArray) { |
| 240 | + System.out.print(number + " "); |
| 241 | + } |
| 242 | + System.out.println(); |
| 243 | + |
| 244 | +/* ------------------------------------------------------- */ |
| 245 | + // TODO: Example_17: insert new element in specified location |
| 246 | + int[] originalArray = {1, 2, 4, 5, 6}; |
| 247 | + int insertIndex = 2; |
| 248 | + int newElement = 3; |
| 249 | + int[] newArray = new int[originalArray.length + 1]; |
| 250 | + for (int i = 0; i < insertIndex; i++) { |
| 251 | + newArray[i] = originalArray[i]; |
| 252 | + } |
| 253 | + newArray[insertIndex] = newElement; |
| 254 | + for (int i = insertIndex + 1; i < newArray.length; i++) { |
| 255 | + newArray[i] = originalArray[i - 1]; |
| 256 | + } |
| 257 | + System.out.print("Array after Insertion: "); |
| 258 | + for (int number : newArray) { |
| 259 | + System.out.print(number + " "); |
| 260 | + } |
| 261 | + System.out.println(); |
| 262 | + } |
| 263 | +} |
0 commit comments