Timeline for Print diamond shape in Java
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 11, 2019 at 21:05 | comment | added | Roland Illig | @Victoria To let IntelliJ indent your code, press Ctrl+Alt+L. Take some time to try out all the other items from the main menu as well, they are worth spending some time. | |
| Mar 11, 2019 at 6:43 | answer | added | 200_success | timeline score: 1 | |
| Mar 11, 2019 at 6:27 | history | edited | 200_success | CC BY-SA 4.0 |
deleted 137 characters in body
|
| Mar 10, 2019 at 21:31 | answer | added | givanse | timeline score: 1 | |
| Mar 10, 2019 at 21:04 | comment | added | givanse | Okay, so that is what you need to specify in your question: That you want to reduce the complexity of your solution (big O notation), ideally to a linear solution i.e. O(n). This is an algorithm design question and you may get more attention in the computer science site cs.stackexchange.com | |
| Mar 10, 2019 at 20:54 | comment | added | Victoria | I just want the code not to use nested loops @givanse | |
| Mar 10, 2019 at 20:43 | comment | added | givanse | As already said, you need to be more specific about what is it that you expect. If you just want to tinker with the code and see how much shorter you can make it, then move your question to codegolf.stackexchange.com | |
| Mar 10, 2019 at 16:01 | history | edited | Victoria | CC BY-SA 4.0 |
added 416 characters in body
|
| Mar 10, 2019 at 12:37 | comment | added | Victoria | Yes I use IntelliJ , sorry for inconvenience but this is my first question to ask here and I don’t know how to indent right. :) | |
| Mar 10, 2019 at 7:33 | comment | added | greybeard | Do you use an IDE? Asking because the code is not indented as usual - one point of perceivability. | |
| Mar 9, 2019 at 21:49 | comment | added | Victoria | I meant by fewer operations | |
| Mar 9, 2019 at 18:46 | comment | added | ggorlen | Welcome to CR! Can you define what you expect by "faster"? This is a pretty vague term. Fewer operations (likely)? Improved Big O (unlikely)? | |
| Mar 9, 2019 at 18:17 | history | edited | 200_success | CC BY-SA 4.0 |
deleted 79 characters in body; edited tags; edited title
|
| Mar 9, 2019 at 17:05 | review | First posts | |||
| Mar 10, 2019 at 7:33 | |||||
| Mar 9, 2019 at 17:02 | history | asked | Victoria | CC BY-SA 4.0 |