Difference in time while printing sorted and unsorted array
How do I write a correct micro-benchmark in Java?
My keyboard doesn't have an Fn key so I can't get the coordinates to show up. I don't know how to get into the multiplayer settings and Shift + F3 doesn't work either.  How can I fix this? Is there an ingame way to change volume? I like the music, but I still prefer my own music.  Is there an ingame way to change the volume?   I can't find it. Ok, so I have made a .tmx file for my first level, but I am unsure how I would load it into my game. Currently I am iterating through an internal array to set the blocks, but I need to know how to load the .tmx file into the code.  Here is my World.java:  import java.awt.Graphics; import java.awt.Graphics2D; import java.awt.Image; import javax.imageio.ImageIO; import java.io.*;  class World {     Image ground;     Block[] blocks = new Block[46];     int map[][] = {             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},             {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},         };     World() {         int enc = -1;         for (int i = 0; i &lt; map.length; i++) {             for (int j = 0; j &lt; map[i].length; j++) {                 if (map[i][j] == 1) {                     enc++;                     blocks[enc] = new Block(j * 32, i * 32, 32, 32, 1);                 } else if (map[i][j] == 2) {                     enc++;                     blocks[enc] = new Block(j * 32, i * 32, 32, 32, 2);                 }             }         }     } } Underfull \hbox in bibliography I am getting lots of "Underfull \hbox" warnings that point to the *.bbl file. It looks like these messages appear only when URLs are very long, like in the below example:  @techreport{nistguidesec,   author    = {Wayne Jansen and Timothy Grance},   title     = {Guidelines on Security and Privacy in Public Cloud Computing},   month    = {January},   note     = {Draft Special Publication 800-144. Available at \url{http://csrc.nist.gov/publications/drafts/800-144/Draft-SP-800-144_cloud-computing.pdf}}, }   In the produced PDF text is correctly hyphened and links are correctly split over several lines (I am using hyperref package)  How can I avoid annoying warning messages about "underfull \hbox" pointing to bibliography? Using \vfill between two texts works:  \newpage bla \vfill blabla   but it doesn't work if there is no text before it:  \newpage \vfill blabla   How can this be achieved? Show that $a^{q-1} \equiv 1 \pmod{pq}$ Assume that $p$ and $q$ are distinct add primes such that $p-1\mid q-1$. If $\gcd(a,pq)=1$ ,show that: $$a^{q-1} \equiv 1 \pmod{pq}$$   I have tried as follows: $$a^{q-1} \equiv 1 \pmod{q} \quad \text{and} \quad a^{p-1} \equiv 1 \pmod{p}$$ $$\implies a^{(q-1)(p-1)} \equiv 1 \pmod{q} \quad \text{and} \quad a^{(q-1)(p-1)} \equiv 1 \pmod{p}$$ $$\implies a^{(q-1)(p-1)} \equiv 1 \pmod{pq}$$ But then I am stuck - please help. How to convert physical Ubuntu operating system into a virtual machine? A while ago I turned my PC into dual boot with Windows and Ubuntu. But my experience is, that I rarely boot into Ubuntu, so I wanted to make it available as virtual machine in Windows rather than as a second OS. Can you provide me some information which is the tool of my choice and how I can achieve this migration? I already have VMWare Player installed. Why don't we define "imaginary" numbers for every "impossibility"? How to include a PDF image into a PDFLaTeX document I am generating a PDF file using pdflatex and need to include another PDF file. The reason is that I have a graphMl file which I exported from yEd graph editor to a PDF file, named sample.pdf. The TeX code to be compiled with pdflatex is given below. I need to include that file at the start of the document.   \documentclass[a4paper,leqno,twoside]{article}  \usepackage[latin1]{inputenc} \usepackage[english]{babel} \usepackage{multirow}  \begin{document}   [% FOREACH st IN Service %]    Name,Id:   [% st.Id %], [% st.Name %]     des:   [% st.Description %]    Customers:  [% FOREACH softservice IN st.Customers %]   [% FOREACH swid IN softservice.SW %]  [% swid.Service %]   [% FOREACH st IN Service %][% IF swid.Service == st.Id %]     ([% st.Name %])     [% END %] [% END %][% END %][% END %]    Suppliers:    [% FOREACH shservice IN st.Suppliers %]    [% FOREACH sw IN shservice.SW %][% sw.Service %]     [% FOREACH st IN Service %][% IF sw.Service == st.Id %]([% st.Name %])      [% END %][% END %][% END %]    [% FOREACH hw IN shservice.HW %][% hw.Type %][% hw.Nr %][% END %]   [% END %]   \newpage   [% END %] \end{document} How to prove a matrix is nilpotent? Given an $n\times n$ upper triangular matrix $A$ with zero on main diagonal, show that $A^n = 0$.   I did some matrix operation and noticed that the diagonal moves up, ultimately all entries will be zero. Is there a nicer way to do it? Is it possible to embed a scrollable frame inside a PDF? (This is an end-of-year crazy question)   Is it possible to embed a (scrollable) frame or a PDF inside a PDF? If so, how to do it in (pdf)LaTeX?  This is something pretty common in HTML (see for example ). Here it is a webpage with PDF frames   Here it is a fake screenshot so you get the idea.  Portable and non-portable (e.g. only-Acrobat) answers are welcomed.     Example of a down arrow below a frame. The up arrow can be on top of the frame and the triangles point up. What Did Lyanna Stark Say to Ned Stark? In the final episode of season 6 we see that Lyanna Stark is whispering something to Ned. What is she saying? Capturing screenshots on the Mac has gotten very slow recently.  It used to be nearly instantaneous but now it is taking more than 10 seconds for the image to appear on the desktop.  I seem to recall having this problem years ago. The workaround was to delete a large accumulation of log files that the os had built up. After I deleted these log files, the screen capture worked very fast again.  Problem is that I cannot remember where these log files are. Searched for quite some time and could not find the information. Show $R \setminus S$ is a union of prime ideals I'm stuck on the following question:     Let $R$ be a commutative ring with $1$, and $S \subseteq R$ a saturated multiplicative set (that is, $1 \in S$ and $x, y \in S$ if and only if $xy \in S$).  Show that $R \setminus S$ is a union of prime ideals.     Here's my attempt so far.  If $a \in R \setminus S$, then the ideal $Ra$ does not intersect $S$, because if $ra$ were in $S$ for some $r \in R$, then $a$ would have to be in $S$.  Thus, it follows by Zorn's lemma that there exist ideals $I$ of $R$ which are maximal with respect to the property that $I \cap S = \emptyset$.  Let $I$ be any such ideal.  If I can show that $I$ is prime, the conclusion will follow.  Let $xy \in I$.  I want to show that $x$ or $y$ is in $I$.  Suppose $x \not\in I$.  Then $I + Rx$ intersects $S$, so there exists $s \in S, a \in I, r \in R$ such that $s = a + rx$.  Then $sy = ay + rxy \in I$, so $sy$, and hence $y$, cannot be in $S$.  Similarly if $y$ is not in $I$, then $x \not\in S$.  So we are reduced to proving the following is impossible: $xy \in I$, $x$ and $y$ are not in $S$, but they aren't in $I$ either. What OpenType math fonts are there available for usage in TeX/LaTeX, e.g. with the unicode-math package?  Here is a MWE which you can use to show off the font.  \documentclass{article} \pagestyle{empty}  \usepackage{amsmath} \DeclareMathOperator\Res{Res} \newcommand*\diff{\mathop{}\!\mathup{d}}  \usepackage{amsthm} \newtheorem{theorem}{Theorem}  \usepackage{unicode-math}  %%% % Set up you text and math fonts %%%  \begin{document}  \begin{theorem}[Residue theorem]   Let $f$ be analytic in the region $G$ except for the isolated   singularities $a_1,a_2,\dots,a_m$. If $\gamma$ is a closed   rectifiable curve in $G$ which does not pass through any of the   points $a_k$ and if $\gamma\approx 0$ in $G$, then   \[     \frac{1}{2\pi i} \int\limits_\gamma f\Bigl(x^{\mathbf{N}\in\mathbb{C}^{N\times 10}}\Bigr)     = \sum_{k=1}^m n(\gamma;a_k)\Res(f;a_k)\,.   \] \end{theorem}  \begin{theorem}[Maximum modulus]   Let $G$ be a bounded open set in $\BbbC$ and suppose that $f$ is a   continuous function on $G^-$ which is analytic in $G$. Then   \[     \max\{\, |f(z)|:z\in G^- \,\} = \max\{\, |f(z)|:z\in \partial G \,\}\,.   \] \end{theorem}  First some large operators both in text: $\iiint\limits_{Q}f(x,y,z) \diff x \diff y \diff z$ and $\prod_{\gamma\in\Gamma_{\bar{C}}}\partial(\tilde{X}_\gamma)$;\ and also on display \[   \iiiint\limits_{Q}f(w,x,y,z) \diff w \diff x \diff y \diff z   \leq   \oint_{\partial Q} f'\Biggl(\max\Biggl\{   \frac{\Vert w\Vert}{\vert w^2+x^2\vert};   \frac{\Vert z\Vert}{\vert y^2+z^2\vert};   \frac{\Vert w\oplus z\Vert}{\vert x\oplus y\vert}   \Biggr\}\Biggr)\,. \]  \end{document}   Here is a similar MWE for ConTeXt.  The images in the answer will only be shown for LaTeX output but the ConTeXt output looks very similar.  %%% % Set up you text and math fonts %%%  \setupmathlabeltext[Res=Res] \definemathcommand[Res][nolop]{\mfunctionlabeltext{Res}} \definemathcommand[diff]{\mathop{}\!\mfunctionlabeltext{diff}}  \defineenumeration   [theorem]   [text={Theorem},    style=italic,    title=yes,    titlestyle=normal,    distance=0pt,    titleleft={(},    titleright={).~},    alternative=serried,    width=fit]  \starttext    \starttheorem[title={Residue theorem}]     Let $f$ be analytic in the region $G$ except for the isolated     singularities $a_1,a_2,\dots,a_m$. If $\gamma$ is a closed     rectifiable curve in $G$ which does not pass through any of the     points $a_k$ and if $\gamma\approx 0$ in $G$, then     \startformula       \frac{1}{2\pi i} \int\limits_\gamma f\Bigl(x^{{\mathbf N}\in\mathbb{C}^{N\times 10}}\Bigr)       = \sum_{k=1}^m n(\gamma;a_k)\Res(f;a_k)\,.     \stopformula   \stoptheorem    \starttheorem[title={Maximum modulus}]     Let $G$ be a bounded open set in $\mathbb{C}$ and suppose that $f$ is a     continuous function on $G^-$ which is analytic in $G$. Then     \startformula       \max\{\, |f(z)|:z\in G^- \,\} = \max\{\, |f(z)|:z\in \partial G \,\}\,.     \stopformula   \stoptheorem    First some large operators both in text:   $\iiint\limits_{Q}f(x,y,z) \diff x \diff y \diff z$   and   $\prod_{\gamma\in\Gamma_{\bar{C}}}\partial(\tilde{X}_\gamma)$;\   and also on display   \startformula     \iiiint\limits_{Q}f(w,x,y,z) \diff w \diff x \diff y \diff z     \leq     \oint_{\partial Q} f'\Biggl(\max\Biggl\{     \frac{\Vert w\Vert}{\vert w^2+x^2\vert};     \frac{\Vert z\Vert}{\vert y^2+z^2\vert};     \frac{\Vert w\oplus z\Vert}{\vert x\oplus y\vert}     \Biggr\}\Biggr)\,.   \stopformula  \stoptext How to generate Bernoulli random variables with common correlation $\rho$? Can you contract the main verb '[I] have' in a sentence? Locking a file in Python Can I use my powers for good? Metric $d(x,y)=\frac{|x-y|}{\sqrt{1+x^2}\sqrt{1+y^2}}$ on $\mathbb{R}$