User talk:Abhiday

Welcome!
Hello, Abhiday, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Unfortunately, one or more of your recent edits to the page Quicksort has not conformed to Wikipedia's verifiability policy, and has been or will be removed. Wikipedia articles should refer only to facts and interpretations that have been stated in print or on reputable websites or in other media. Always remember to provide a reliable source for quotations and for any material that is likely to be challenged, or it may be removed. Wikipedia also has a related policy against including original research in articles. Additionally, all new biographies of living people must contain at least one reliable source.

If you are stuck and looking for help, please see the guide for citing sources or come to the new contributors' help page, where experienced Wikipedians can answer any queries you have! Here are a few other good links for newcomers:
 * The five pillars of Wikipedia
 * Contributing to Wikipedia
 * How to edit a page
 * Help pages
 * Tutorial
 * How to write a great article
 * Simplified Manual of Style

I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes ( ~ ); this will automatically produce your name and the date. If you need help, check out Questions, ask me on my talk page, or. Again, welcome. --CiaPan (talk) 17:12, 15 July 2016 (UTC)

Quicksort
I have reverted your contribution to the Quicksort article. Your modification to the partitioning code was erroneous and actually needless. ---CiaPan (talk) 17:14, 15 July 2016 (UTC)
 * It was erroneous because it shifted the swap position index, but did not shift the starting position for scanning (which remained ). That would cause wrong ordering of array items. Have you tried to analyze the code behavior e.g. on array [1,3,2]?
 * And it was unnecessary because it saves about one swap per partitioning (on average, assuming and  approximately equally probable) at the expense of additional loop, which expanded the main part of the routine by half (from 5 to 7 lines of code, not counting initialization nor the final swap).