How can we prove that radix sort correctly sorts an array of 2 elements with 2 digits each ?


closed as unclear what you're asking by Evil, David Richerby, Juho, Nicholas Mancuso, Gilles Feb 12 '17 at 19:43

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • 2
    $\begingroup$ Welcome to CS.SE! What research have you done? Where have you looked? Have you tried working through some examples, looking for patterns, forming a hypothesis, and trying to prove it? Which variety of Radix sort are you referring to? (See en.wikipedia.org/wiki/Radix_sort.) See cs.stackexchange.com/help/how-to-ask for suggestions on how to improve your question. $\endgroup$ – D.W. Jan 21 '17 at 5:49
  • $\begingroup$ I am sorry, I am new here. Thanks for the welcome. I will improve the way I ask. I am talking about Most Significant digit Radix sort $\endgroup$ – Malgorythm Jan 21 '17 at 6:00