mjhjmtu

Clash Royale CLAN TAG #URR8PPP up vote 0 down vote favorite I was just going through the official bash repository(I don't usually do this) for something unrelated but noticed that bash 5 was already in beta. I was just curious about what's going to be new in bash 5 but couldn't find any information. Can someone please summarize the changes between 4.4 and 5 version of Bash bash upgrade share | improve this question asked 18 mins ago akabhirav 106 3 New contributor akabhirav is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct. It's right there in the CHANGES file: git.savannah.gnu.org/cgit/bash.git/tree/… – muru 5 mins ago add a comment  |  up vote 0 down vote favorite I was just going through the official bash repository(I don't usually do this) for somethin...

Clash Royale CLAN TAG #URR8PPP up vote 0 down vote favorite Using shell script I am making a db call on database VM and I am getting and storing the query response into a .txt file. Which looks like below: X folder Check: Number of Files on X Outbound 17 Y folder Check: Number of Files on Y Outbound 17 Z folder Check: Number of Files on Z Outbound 18 Now for each of the X,Y and Z. I am basically receiving files(counts) on their respective locations. So I am expecting to get "18" files for each X,Y and Z. Now using shell I want to be able to know/store the folders for which I didn't receive 18 files. Example: here in the above case I should get that I am missing files for X and Y folders. Any help ?? Thank you. shell-script cron text share asked 3 mins ago harveySp 1 1 add a comment  |  up vote 0 down vote favorite Using shell script I am making a db call on database VM and I am getting and storing the qu...

Clash Royale CLAN TAG #URR8PPP up vote 1 down vote favorite A researcher claimed that she discovered a comparison-based sorting algorithm that runs in $O(nlog(sqrtn))$ . Given the existence of an $Omega(nlog(n))$ lowerbound for sorting, how can this be possible? Hint : It is possible. Don't waste time trying to disprove it. Just show why it is possible. algorithms share | cite | improve this question edited 3 hours ago Thinh D. Nguyen 3,451 1 14 68 asked 3 hours ago confucius_did_shrooms 6 1 New contributor confucius_did_shrooms is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct. 1 $n , logsqrtn = frac12n , log(n)= Omega(n ,logn)$. There's only a constant factor difference. – Gokul 3 hours ago add a comment  |  up vote 1 down vote favorite A researcher claim...