User talk:MCiura

Welcome

Hello, and welcome to Wikipedia. Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers:

• How to edit a page
• Editing tutorial
• Picture tutorial
• How to write a great article
• Naming conventions
• Manual of Style

I hope you enjoy editing here and being a Wikipedian! By the way, you can sign your name on Talk and vote pages using three tildes, like this: ~~~. Four tildes (~~~~) produces your name and the current date. If you have any questions, see the help pages, add a question to the village pump or ask me on my Talk page. Again, welcome! --Lst27 19:52, 14 Oct 2004 (UTC)

The Humungous Image Tagging Project

Hi. You've helped with the Wikipedia:WikiProject Wiki Syntax, so I thought it worth alerting you to the latest and greatest of Wikipedia fixing project, User:Yann/Untagged Images, which is seeking to put copyright tags on all of the untagged images. There are probably, oh, thirty thousand or so to do (he said, reaching into the air for a large figure). But hey: they're images ... you'll get to see lots of random pretty pictures. That must be better than looking for at at and the the, non? You know you'll love it. best wishes --Tagishsimon (talk)

Voting

You might want to know that there was a voting started at Wikipedia_talk:WikiProject_Geography_of_Poland#Vote. Halibutt 00:18, 8 February 2006 (UTC)

Wikipedia:WikiProject Silesia

Cześć. Zapraszam cię do Wikipedia:WikiProject Silesia. Mam nadzieję że się wpiszesz na listę użytkowników i coś czasem poedytujesz związanego z naszym Śląskiem :) LUCPOL 23:07, 20 February 2007 (UTC)

Notification: changes to "Mark my edits as minor by default" preference

Hello there. This is an automated message to tell you about the gradual phasing out of the preference entitled "Mark all edits minor by default", which you currently have (or very recently had) enabled.

On 13 March 2011, this preference was hidden from the user preferences screen as part of efforts to prevent its accidental misuse (consensus discussion). This had the effect of locking users in to their existing preference, which, in your case, was true. To complete the process, your preference will automatically be changed to false in the next few days. This does not require any intervention on your part and you will still be able to manually mark your edits as being 'minor'. The only thing that's changed is that you will no longer have them marked as minor by default.

For established users such as yourself there is a workaround available involving custom JavaScript. If you are familiar with the contents of WP:MINOR, and believe that it is still beneficial to the encyclopedia to have all your edits marked as such by default, then this discussion will give you the details you need to continue with this functionality indefinitely. If you have any problems, feel free to drop me a note.

Thank you for your understanding and happy editing :) Editing on behalf of User:Jarry1250, LivingBot (talk) 21:29, 14 March 2011 (UTC)

Shell sort

File:Sorting shellsort anim.gif

Visualisation of Shell sort.

I'll have some spare time tomorrow. I'll see what I can do. Thanks for your interest. --Simpsons contributor (talk) 18:18, 6 August 2011 (UTC)

No problem. I think that embossed orange bar/cornflower blue background colour scheme works better too. If you want the source code (the graphics/sorting is done with C#, animated gif creation with Java) then get back in touch. --Simpsons contributor (talk) 12:36, 7 August 2011 (UTC)

Shellsort copy edit

Hello MCiura. Thanks very much for making your expertise available to Wikipedia. I've copyedited Shellsort as you requested on the GOCE Requests page.

Discussing computational complexity in the 3-gap case, your original says "A complicated function ψ(h, g) from the last formula is asymptotically ...", and I think this does not quite make sense in English. I have changed it to "ψ(h, g) in the last formula is a complicated function asymptotically ...". I think this might be your meaning, but am not 100% sure. Please would you check this out and correct it if necessary, or we can discuss it if you wish.

By the way, I find the animation at the top very distracting and not really helpful. The walkthrough in the Description section is clear enough, I think.

To help you in future, please would you place <ref> tags after any punctuation. (See Wikipedia:MOS#Punctuation_and_footnotes). Thanks. --Stfg (talk) 14:52, 5 September 2011 (UTC)

Asymptotic analysis of result on shellsort

We know that a lower bound on any sorting algorithm that uses comparison is $\mathrm{\Omega }(N\ln (N))$. See Knuth, Vol. 3. You will notice that all of the other routines have a run time that are $\omega (N\ln (N))$.

Now, if $\underset{N\to \mathrm{\infty }}{\lim }\frac{f(N)}{g(N)}=0$, we say that $f(N)=o(g(N))$.

In this case, the worst-case time complexity is given by $O(e^{\sqrt{8\ln (5/2)\ln N}})$. If we compare the given function and $N$, we get:

$\underset{n\to \mathrm{\infty }}{\lim }\frac{e^{\sqrt{8\ln (5/2)\ln (N)}}}{N}=0$

and you can either ask Maple,

limit( exp( sqrt( 8*ln(5/2)*ln(N) ) )/N, N = infinity );
                                                               0

or just try it yourself with increasingly larger numbers. Why not just pick your mathematical software of your choice and plot $e^{\sqrt{8\ln (5/2)\ln N}}$--its growth looks more like the logarithm.

Therefore, if the limit is 0, then the worst-case time complexity is being claimed as a function that is $o(N)$ which contradicts the above known lower bound of $\mathrm{\Omega }(N\ln (N))$. In fact, if you try it out, you will find that $e^{\sqrt{8\ln (5/2)\ln N}}=o(N^d)$ for any $d>0$ but $e^{\sqrt{8\ln (5/2)\ln N}}=\omega (\ln (N))$.

I don't know what the correct answer is--it might actually be $O(N{e}^{\sqrt{8\ln (5/2)\ln N}})$, as this is at least plausible--but the answer that is there is wrong and it should not appear. — Preceding unsigned comment added by 129.97.10.179 (talk) 23:17, 16 December 2011 (UTC)

ArbCom elections are now open!

{{Wikipedia:Arbitration Committee Elections December 2015/MassMessage}} MediaWiki message delivery (talk) 12:51, 23 November 2015 (UTC)

DYK nomination of Pentagramma mirificum

File:Symbol question.svg Hello! Your submission of Pentagramma mirificum at the Did You Know nominations page has been reviewed, and some issues with it may need to be clarified. Please review the comment(s) underneath your nomination's entry and respond there as soon as possible. Thank you for contributing to Did You Know! Yoninah (talk) 21:42, 29 January 2019 (UTC)

ArbCom 2019 election voter message

File:Scale of justice 2.svg

Hello! Voting in the 2019 Arbitration Committee elections is now open until 23:59 on . All eligible users are allowed to vote. Users with alternate accounts may only vote once. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate in the 2019 election, please review the candidates and submit your choices on the [[Special:SecurePoll/vote/Template:Arbitration Committee candidate/data|voting page]]. If you no longer wish to receive these messages, you may add Template:Tlx to your user talk page. MediaWiki message delivery (talk) 00:04, 19 November 2019 (UTC)