I am using Array.Sort() with the parameters shown in the code. I'm unable to get the required order for the following array  jONeS jones joNes jones aDaMs adams adaMS ADAMs   The program shown prints the following  adams aDaMs adaMS ADAMs jONeS jones joNes jones   Where as according to me the following order should be printed  aDaMs adams adaMS ADAMs jONeS jones joNes jones   Note the first two elements displayed wrongly. Where am I going wrong?  int N = Convert.ToInt32(Console.ReadLine()); string[] arr=new string[N]; for (int i = 0; i &lt; N; ++i)     arr[i] = Console.ReadLine(); Array.Sort(arr, StringComparer.Create(new CultureInfo("en-US"),true)); Console.WriteLine(); for (int i = 0; i &lt; N; ++i)     Console.WriteLine(arr[i]);
Is the sorting algorithm used by .NET's Array.Sort() method a  algorithm?
High CPU usage by "System" and "System interrupts" (caused by ACPI.sys) I have a laptop, which was running Windows 8.1 x64 without any problems. Now with Windows 10 x64 installed, Task Manager constantly shows unusual CPU usage by "System" and "System interrupts". To solve this, I already tried the following, without success:   Disabling and uninstalling all non-essential drivers. Installing newer drivers than the ones that were automagically installed (if available). Disabling/enabling fast boot option. Disabling all of the non-essential services. Sysprep. Resetting BIOS to defaults and various combinations of settings. Flashing BIOS to the latest available version. Clean install from the same media that I use for other PCs. Installing all of the updates offered in Windows Update to this day. Windows Performance Recorder / Analyzer.   I'm not very familiar with Windows Performance Analyzer, so I'm hoping someone here can point me in the right direction - what exactly should I look for, to figure out which device/driver is the culprit. Or, if there's any other approach to figuring out this problem?  For the brave souls, here's my  and a screenshot of the problem: I have a character playing a multiclass Barbarian/Monk. Does the resistance from rage combine with Deflect Missiles to negate the damage and make the reaction attack? group of units in a topological ring Differences between astronomy, astrophysics and cosmology? How to serve static files in Flask What can I do to manage my phone's internal storage? Real world uses of hyperbolic trigonometric functions I covered hyperbolic trigonometric functions in a recent maths course. However I was never presented with any reasons as to why (or even if) they are useful.  Is there any good examples of their uses outside academia? Conformal Maps onto the Unit Disc in $\mathbb{C}$ What does "$$" mean in the shell? Is $f(x,y)=(xy)^{2/3}$ differentiable at $(0,0)$? I looked at the graph of $f(x,y)=(xy)^{2/3}$ at the origin, and no matter how far I zoom in it has four corners along $x=\pm y$, so it doesn't look like it is differentiable as $z=0$ doesn't look like a tangent plane.  I also found that its partial derivatives are not continuous at $(0,0)$, e.g.  $$ \lim_{(ky^2,y) \to (0,0)} \frac{\partial f}{\partial x} = \lim_{(ky^2,y) \to (0,0)} \frac{2}{3}x^{-\frac{1}{3}}y^{\frac{2}{3}} = \frac{2}{3}k^{-\frac{1}{3}} $$ (although $\frac{\partial f}{\partial x}(0,0) = \frac{\partial f}{\partial y}(0,0) = 0$)  I also tried to prove/disprove its differentiability by definition, and for it to be differentiable I need $$ \lim_{(x,y) \to (0,0)} \frac{f(x,y)-0}{\sqrt{x^2+y^2}} =0 $$ but then I got stuck. Am I even on the right track?  [UPDATE] I need to do the same thing for $f(x,y)=(xy)^{\frac{1}{3}}$... I think the answer is that $(xy)^{2/3}$ is differentiable but $(xy)^{1/3}$ is not, according to my professor but I'm not sure I remember reading this as a kid and it starts out with:   a boy in his home village where the other kids are mean to him during sports and they heat up their home with floating logs or something.   The kid is being hunted by some reaper character and that reaper finds him at a place called "The Edge" or something similar.   He buys a glove covered in an expensive dust that purifies things and is really rare.  In one book they had to climb down the edge for some reason.  There was another part where people only communicated telepathically and when sneaking into somewhere he only thought of light.  One of the main things is the floating ships and how he is really good at flying them and he assembles a team for a mission or something.  There is like float powder and stuff.  I read this close to 10 years ago. When a sentence uses a parenthetical plural, should the rest of the sentence treat it as singular or plural? Windows wildcards with files having more than 3 characters extensions On Windows 7, I have a directory containing the following four files:   xxx.txt xxx.txt2 xxx2.txt xxx2.txt2   With the file have more than 3 character as a file extension, the behavior of the wildcard * seems odd:  dir *.txt  10/13/2014  04:14 PM                 6 xxx.txt 10/13/2014  04:17 PM                 6 xxx2.txt 10/13/2014  04:17 PM                 6 xxx2.txt2 10/13/2014  04:14 PM                 6 xxx.txt2            4 File(s)             24 bytes            0 Dir(s)   6,660,980,736 bytes free   I would expect to see only the two files with txt extension and not the ones with txt2 (like it would on a Linux machine). Does MS-DOS ignore the truncate the file extension to 3 characters or does it add automatically another wildcard at the end? If I want to delete only the files with txt extension and not the one with txt2, which command should I use? Thanks Below, the  of second-order logic is used.    My question is about a second-order analogue of $ZFC$ other than the usual "second-order $ZFC$." Rather than define the latter, I'll just state that its (set-sized) models are exactly the $V_\kappa$s with $\kappa$ strongly inaccessible (or if you prefer, the uncountable Grothendieck universes).  Specifically, I'm interested in the second-order theory consisting of the usual (first-order) axioms of Pairing, Extensionality, Union, Choice, Infinity, and Powerset, and the Separation and Replacement schemes ranging over second-order formulas. I'll call this "$ZFC_2^{scheme}$."    Specifically, for each formula $\varphi(x, y_1,...,y_k)$ of second-order logic with only the displayed variables, each of which is first-order, we have a corresponding Separation and Replacement instance. We do not allow second-order parameters here, so formulas with second-order free variables don't yield Separation/Replacement instances.   The passage from $ZFC$ to $ZFC_2^{scheme}$ has a nice uniformity: it's an example of a more general operation $\mathcal{ZFC}$ which spits out a $ZFC$-analogue given a logic at least as strong as first-order logic.    This is the reason for the parameter restriction above: I want $ZFC_2^{scheme}$ to look just like $\mathcal{ZFC}(\mathcal{L})$ for any other logic $\mathcal{L}$, and not take into account the particular feature that we now have a new kind of variable at our disposal - and in particular, take as "syntax-free" an approach to logics as we can get away with. (This is a choice of arguable value, but it's the one I'm making for now.)   It's easy to show that every model of $ZFC_2^{scheme}$ is well-founded, so to understand its models we only need to look at transitive sets. A natural hope at this point is that $ZFC_2^{scheme}$ is just second-order $ZFC$ in disguise, that is, that for a transitive set $M$ we have $M\models ZFC_2^{scheme}$ iff $M=V_\kappa$ for some strongly inaccessible $\kappa$. However, this isn't at all obvious to me (although it is easy to show the right-to-left direction).     Question. What are the (set-sized) models of $ZFC_2^{scheme}$?   (Note by contrast that the "arithmetic analogues" $PA_2^{scheme}$ and second-order $PA$ are equivalent since each pins down $\mathbb{N}$ up to isomorphism - although that leads to .)  (I'm happy to drop Choice if that would help.)  EDIT: As Hanul Jeon pointed out below,  shows that consistently $ZFC_2^{scheme}$ (there called "$ZFC_2^{def}$") has countable models, so we have a partial answer. However, I don't see at the moment a way to get an outright $ZFC$ proof that $ZFC_2^{scheme}$ is strictly weaker than second-order $ZFC$. What are valid values for "data defined" labeling settings? How could it be that the entropy of gas is not infinite?  If we use the formula $S=k\ln(\Omega)$ we get infinity because there are an infinite number of possible situations (because there are infinite possibilities of position and momentum for each molecule). $S=\{(n,{1\over n}):n\in\mathbb{N}\}$ is closed in $X$? The topological space $X=\mathbb{N}\times \mathbb{Q}$ with subspace topology of $\mathbb{R}^2$ the set $S=\{(n,{1\over n}):n\in\mathbb{N}\}$ is closed in $X$?  $S^c=\phi\times\{{1\over n}\}^c$ right? but I know $\mathbb{Q}$ is neither open nor closed in $\mathbb{R}$, I am confused here, could any one help me to answer this question?  the boundary of $S$ is $\bar{S}\setminus $ int S. as int S is $\phi$ so boundary is $\mathbb{N}\times \mathbb{R}$? Let $P$ be a prime. Show that $\exists$ $x \in \mathbb{N}$ such that $f(x) = p$ then $\exists$ $y \in \mathbb{N}$ such that $g(y) = p$ What is given?  $$\text{Let P be a prime}$$ $$\text{Let} \space f(x)= 3x+1$$ $$\text{Let} \space g(x)= 6x+1$$  Show that: If there exists $x \in \mathbb{N}$ such that $f(x) = P $ , then there exists a $y \in \mathbb{N}$ , such that $g(y) = P$  What have I tried?   Given the question says 'show that', that leads me to believe I need to do a proof of sorts. I'm guessing it might be a proof by either strong induction, or just induction (or maybe just a direct proof?).  I don't even know how to set this up If $f(x) =$ $3x + 1 = $ prime...for any integer $x$, then there exists an integer $y$ such that $g(y) = 6y + 1 = $ prime?   Any hints or starting points would be greatly appreciated.   $$\text{Thanks in advance!}$$ How does editing work? It is possible for users to edit an existing post.   How do edits work? Who may edit a question or answer? How can you tell what has been changed between edits?      For more information, see "" in the .     Related: Teenage girl in life-sustaining valley on poisoned Earth visited by another survivor