Use Java to write a program that prompts the user for a positive odd integer , generates a normal magic square of order size of that integer, and prints it with numbers right-justified and aligned in evenly-spaced columns. (Magic square definition: https://en.wikipedia.org/wiki/Magic_square. Can assume that the numbers in the square are 3 digits or less (i.e. size ≤ 31). Have the construction of the 2D integer array magic square take place in a public static method getMagicSquare that takes in an integer n as a parameter and returns the 2D integer array magic square as specified. Your main method should perform input and output (I/O) and call this method to perform the computation. Methods for generating a magic square : Assign 1 to our initial current position: the bottom row, middle column. Place each successive value (up to size * size) in the first of the following positions that is unoccupied: (1) one space down and to the right, or (2) one space up. Positions wrap around the sides, top and bottom, as shown in the following example transcripts (user input underlined): Please enter a positive odd integer: 192 2334344 65 86 107 128 149 17024 45 66 87 108 129 150462567 88 109 13047 68 89 11027 48 699028 49 708 29 50172 193 214 235 256 277 298 319 340 361171 173 194 215 236 257 278 299 320 3413151 153 174 195 216 237 258 279 300 321 342 344 4131 152 154 175 196 217 238 259 280 301 322 324 345 5 26111 132 134 155 176 197 218 239 260 281 302 323 325 346 691 112 133 135 156 177 198 219 240 261 282 303 305 326 347 771 92 113 115 136 157 178 199 220 241 262 283 304 306 327 34851 72 93 114 116 137 158 179 200 221 242 263 284 286 307 328 349 9 3031 52 73 9496 117 138 159 180 201 222 243 264 285 287 308 329 350 1011 32 53 74 95 97 118 139 160 181 202 223 244 265 267 288 309 330 351352 12 33 54 75 77 98 119 140 161 182 203 224 245 266 268 289 310 331332 353 13 34 55 76 78 99 120 141 162 183 204 225 246 248 269 290 311312 333 354 1435 56 58 79 100 121 142 163 184 205 226 247 249 270 291292 313 334 355 15 36 57 59 80 101 122 143 164 185 206 227 229 250 271272 293 314 335 3561637 396081 102252 273 294 315 336 357 17 38 40232 253 274 295 316 337 358 18 20212 233 254 275 296 317 338 359 19192 213 234 255 276 297 318 339 360123 144 165 186 207 228 230 25161 82 103 124 145 166 187 208 210 23141 62 83 104 125 146 167 188 209 21121 42 63 84 105 126 147 168 189 1911 22 4364 85 106 127 148 169 190

Answered: Use Java to write a program that…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Use Java to write a program that prompts the user for a positive odd integer , generates a normal magic square of order size of that integer, and prints it with numbers right-justified and aligned in evenly-spaced columns. (Magic square definition: https://en.wikipedia.org/wiki/Magic_square. Can assume that the numbers in the square are 3 digits or less (i.e. size ≤ 31). Have the construction of the 2D integer array magic square take place in a public static method getMagicSquare that takes in an integer n as a parameter and returns the 2D integer array magic square as specified. Your main method should perform input and output (I/O) and call this method to perform the computation.

Methods for generating a magic square : Assign 1 to our initial current position: the bottom row, middle column. Place each successive value (up to size * size) in the first of the following positions that is unoccupied: (1) one space down and to the right, or (2) one space up. Positions wrap around the sides, top and bottom, as shown in the following example transcripts (user input underlined):

Please enter a positive odd integer: 19
2 23
343
44 65 86 107 128 149 170
24 45 66 87 108 129 150
46
25
67 88 109 130
47 68 89 110
27 48 69
90
28 49 70
8 29 50
172 193 214 235 256 277 298 319 340 361
171 173 194 215 236 257 278 299 320 341
3
151 153 174 195 216 237 258 279 300 321 342 344 4
131 152 154 175 196 217 238 259 280 301 322 324 345 5 26
111 132 134 155 176 197 218 239 260 281 302 323 325 346 6
91 112 133 135 156 177 198 219 240 261 282 303 305 326 347 7
71 92 113 115 136 157 178 199 220 241 262 283 304 306 327 348
51 72 93 114 116 137 158 179 200 221 242 263 284 286 307 328 349 9 30
31 52 73 94
96 117 138 159 180 201 222 243 264 285 287 308 329 350 10
11 32 53 74 95 97 118 139 160 181 202 223 244 265 267 288 309 330 351
352 12 33 54 75 77 98 119 140 161 182 203 224 245 266 268 289 310 331
332 353 13 34 55 76 78 99 120 141 162 183 204 225 246 248 269 290 311
312 333 354 14
35 56 58 79 100 121 142 163 184 205 226 247 249 270 291
292 313 334 355 15 36 57 59 80 101 122 143 164 185 206 227 229 250 271
272 293 314 335 356
16
37 39
60
81 102
252 273 294 315 336 357 17 38 40
232 253 274 295 316 337 358 18 20
212 233 254 275 296 317 338 359 19
192 213 234 255 276 297 318 339 360
123 144 165 186 207 228 230 251
61 82 103 124 145 166 187 208 210 231
41 62 83 104 125 146 167 188 209 211
21 42 63 84 105 126 147 168 189 191
1 22 43
64 85 106 127 148 169 190

Expert Solution

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions