Were now on arrays and the job is to do a list of numbers and then it would show the descending order of those numbers.  Here's the condition: A Nested Loop and a Decisive Structure.  I wasn't able to use this code:    for (iLoop = iNumber.length - 1; iLoop &gt;= 0; iLoop--){             System.out.println("" + iNumber[iLoop]);     Because it wouldn't show a nested loop one nor any decisive structures.  I can't use any sort of method YET. Only the first for loop will do the loop for the array. Here's my code next:            int iX, iY, iLoop;         Scanner var = new Scanner(System.in);         int[]iNumber = new int [10];         for (int iIndex = 0; iIndex &lt; iNumber.length; iIndex++){             System.out.print("Enter a number: ");             iNumber [iIndex] = var.nextInt();         }         for (iX = 0; iX &lt; iNumber.length; iX++){             for (iY = iX + 1; iY &lt; iNumber.length; iY++){                 if (iNumber[iX] &lt; iNumber[iY]){                     iLoop = iNumber[iX];                     iNumber[iX] = iNumber[iY];                     iNumber[iY] = iLoop;                 }             }         System.out.println("" + iNumber);         }     } }     Now, I can't now think why the output is:    [I@1909752 [I@1909752 [I@1909752 [I@1909752 [I@1909752 [I@1909752 [I@1909752 [I@1909752 [I@1909752 [I@1909752     I don't know what to do again. Someone help me, thank you in advance.
In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]
I need to execute a directory copy upon a user action, but the directories are quite large, so I would like to be able to perform such an action without the user being aware of the time it takes for the copy to complete.  Any suggestions would be much appreciated. Looking at moving my laundry upstairs, and the right answer is to combine two adjacent closets to get the width and move one of their walls a foot or two into the kitchen to get the depth.  The kitchen floor is 10-inch-square tiles. It would be sort of nice if that continued on into the laundry closet. I do have a full bundle of spare tiles in the basement.   Question: Could/should I plan on the new wall coming in on top of the existing tiles (presumably having to drill to secure the footer without shattering them), or should I plan on removing the ones under the footer and fitting cut pieces back in afterward? The sum of powers of two and two's complement – is there a deeper meaning behind this? Storing the original document class page layout with geometry I have multiple cameras in a scene. What I want to do is to change which one is active. This way I can view the scene from different angles. How would I do this? I have a  with a fingerprint reader:    How to make Ubuntu recognise it and use it for login?  I already tried:  sudo add-apt-repository ppa:fingerprint/fingerprint-gui sudo apt-get update   ... but this GUI did not recognizes my device. Does anyone knows any other option? Proof Verification : Prove -(-a)=a using only ordered field axioms I need to prove for all real numbers $a$, $-(-a) = a$ using only the following axioms:     Thanks to many members of the Mathematics Stackexchange Community, I have the following proof worked out:  Theorem: The Additive Inverse Identity is Unique  $ ( \forall a,b,c \in \mathbb{R} )(a+b=0) \land (a+c=0) \\ ( \forall a,b,c \in \mathbb{R} )(a+b=a+c) \\ ( \forall a,b,c \in \mathbb{R} )(b=c) \\ \text{QED} \\ $  Theorem $\textbf{a} \cdot \textbf{0 = 0}$  $ \begin{align} a \cdot 0 &amp;= a \cdot 0 \\ a \cdot (0 + 0) &amp;= a \cdot 0 \\ a \cdot 0 + a \cdot 0 &amp;= a \cdot 0 \\ a \cdot 0 + a \cdot 0 + (-a) \cdot 0 &amp;= a \cdot 0 + (-a) \cdot 0 \\ a \cdot 0 &amp;= 0 \\ &amp;\text{QED} \\ \end{align} $  Theorem: $-\textbf{1} \cdot \textbf{(a) = (}-\textbf{a)}$  $ \begin{align} a \cdot 0 &amp;= 0 \\ a \cdot \left[ 1 + (-1) \right] &amp;= a + (-a) \\ 1 \cdot a + (-1) \cdot a &amp;= a + (-a) \\ -1 \cdot (a) &amp;= (-a) \\ &amp;\text{QED} \\ \end{align} $  Theorem: $-\textbf{(}-\textbf{a) = a}$  $ \begin{align} 0 &amp;= 0 \\ -a \cdot 0 &amp;= 0 \\ -a \cdot \left[ 1 + (-1) \right] &amp;= 0 \\ -a \cdot 1 + -a \cdot (-1) &amp;= 0 \\ -a + \left[ -(-a) \right] &amp;= 0 \\ -(-a) &amp;= a \\ \text{QED} \\ \end{align} $  Does everything look alright? Have I missed anything?  Also--why is it necessary to show that the additive inverse is unique?  Many thanks in advance. Make terminal use pageup/pagedown instead of shift-pageup/shift-pagedown? I've grown quite weary of shift-pgup to page up in gnome terminal, the command line, terminator, and guake, etc.  Any way to easily make these apps use the straight page-up and page-down keys for paging around? Lagrange Multipler KKT condition I am looking at SVM, and reviewing Lagrange multiplier. Let's say with the constraint function $$g(x,y) = x^2 + y^2 -1 &gt; 0, $$ I am maximizing $$f(x,y) = x + y -1 .$$ Intuitively, since the constraint function does not provide a finite constrained region, there is no solution, and $f(x,y)$ can infinitely increase.  However, if I just plainly proceed with Lagrange multiplier calculation,  $$L(x,\lambda) = (x + y -1) +\lambda(x^2 + y^2 -1)$$ I get the solution: $$y,x = -\sqrt{2}/2, \lambda = 1/\sqrt{2}$$ And this still satisfies KKT conditions although the solution is wrong.  $$g(x) =&gt; 0 , \lambda =&gt;      0, \lambda g(x) = 0.$$  I expected that I would have some result that conflicted KKT conditions, but nothing was violated.   Does this mean that Lagrange multiplier under KKT conditions can produce a solution that cannot be solved, without giving any indication of intractability?  If functions are complicated, what's the systematic way to confirm that the optimization with inequality constraint functions is solvable using Lagrange multiplier? Can I stop 100% Width Text Boxes from extending beyond their containers? Lets say I have a text box that I want to fill a whole line. I would give it a style like this:  input.wide {display:block; width: 100%}   This causes problems because the width is based on the content of the text box. Text boxes have margin, borders, &amp; padding by default, which makes a 100% width text box larger than its container.  For example, here on the right:    Is there any way to make a text box fill the width of its container without expanding beyond it?  Here is some example HTML to show what I mean:  &lt;!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"&gt; &lt;html xmlns="http://www.w3.org/1999/xhtml" &gt; &lt;head&gt;     &lt;title&gt;Untitled Page&lt;/title&gt;     &lt;style type="text/css"&gt;         #outer{border: 1px solid #000; width: 320px; margin: 0px;padding:0px}         #inner{margin: 20px; padding: 20px; background: #999;border: 1px solid #000;}         input.wide {display:block; margin: 0px}         input.normal {display:block; float: right}     &lt;/style&gt; &lt;/head&gt; &lt;body&gt;     &lt;div id="outer"&gt;         &lt;div id="inner"&gt;             &lt;input type="text" class="wide" /&gt;             &lt;input type="text" class="normal" /&gt;             &lt;div style="clear:both;"&gt;&lt;/div&gt;         &lt;/div&gt;     &lt;/div&gt; &lt;/body&gt; &lt;/html&gt;   If this is run, you can see by looking at the "normal" text box that the "wide" text box is sticking out beyond the container. The "normal" text box floats to the actual edge of the container. I'm trying to make the "wide" text box fill its container, without expanding beyond edge like the "normal" text box is. Invoking makeindex for nomencl I have spent many many hours failing to implement nomencl for my PhD thesis. The problem seems to be with invoking makeindex and creating the .nls file  I keep reading that I must invoke makeindex or write a Unix command:  makeindex filename.nlo  -s nomencl.ist -o filename.nls   But I don't know how to do this. I would be grateful for some instructions i.e. where do I type the command?    I am using TeXShop 2.43. Is there any way to create multiple insert statements in a ms-access query? How does a fork bomb work? This is rather difficult to describe with fancy pictures with red circles but it's easily reproducible.  Whenever I click Leave Closed in the re-open queue on MSO the "nominate this question for re-opening" pop-up appears. I normally press escape out of shock and a leave closed vote is recorded.  This is the latest review it's happened to me on:   You can also test it on , I clicked reopen this time and a leave closed vote was recorded but I also got a red popup stating that an error had occurred.  This is also occurring when the Edit &amp; Reopen button is clicked, the edit box opens for a second before being overridden by the popup. unable to use synaptic via launcher When I open synaptic via launcher on gnome-panel, it opens and asks me for the password but if I enter the password, it says its wrong even though the password is correct and it used to work OK few days ago. If I open synaptic via terminal using sudo synaptic then it opens OK without any problem. Sometimes it takes too long for the network manager to update to see new wireless AP. Is it possible to change the time interval between checks? How can I add some html to my Mail.app signature? I want to add my company logo and and some juice to my contact information in the signature part in Mail.app. How can I do that with little or no efforts? Is it possible to open a remote terminal session on a Windows XP machine? Remote desktop is... useable, but I'd like to get a proper remote terminal window open on the Windows XP machine, like I'm able to with Linux. A quick Google points at , but it looks like it's only for Vista/Server. How to associate multimedia keys to Foobar2000? I have a class like this:  public class myClass {   public List&lt;myOtherClass&gt; anewlist = new List&lt;myOtherClass&gt;;    public void addToList(myOtherClass tmp)   {     anewList.Add(tmp);   }  }   So I call "addToList" a hundred times, each adding a unique item to the list.  I've tested my items to show that before I run the "addToList" method, they are unique.  I even put a line in to test "tmp" to make sure it was what I was expecting.  However, when I do this (lets say myClass object is called tmpClass):  int i = tmpClass.anewList.Count(); for (int j = 0; j&lt;i; j++) {    //write out each member of the list based on index j... }   I get the same exact item, and it's the last one that was written into my list.  It's as if when I add, I'm overwriting the entire list with the last item I've added.    Help?  This makes no sense. I've also tried List.Insert, where I'm always inserting at the end or at index 0.  Still no dice.  Yes, I'm doubly source my indexing is correct and when I do my test I'm indexing through each of the elements.  :)  UPDATE: Okay, I tried this and still had the same problem:  foreach(myOtherClass tmpC in tmpClass.anewList) {         Console.WriteLine(tmpC.theStringInMyClass.ToString()); }   and still for each of the 100 items, I got the same string output... I'm sure I'm doing something completely stupid, but I don't know what yet. I'm still 100% sure that the right string is getting passed in to begin with.  -Adeena    Okay, I tried this and still had the same problem:  foreach(myOtherClass tmpC in tmpClass.anewList) {     Console.WriteLine(tmpC.theStringInMyClass.ToString()); }   and still for each of the 100 items, I got the same string output...  I'm sure I'm doing something completely stupid, but I don't know what yet. I'm still 100% sure that the right string is getting passed in to begin with.  -Adeena