User talk:Prashantvatsjha

Quicksort and a base case
Hi, ! Welcome to Wikipedia!

I just want to explain why I have restored the previous version of the Quicksort article, which you edited here: Special:Diff/849040546.

I did it because the term 'base case' was used intentionally there. It has a specific meaning in the context of recursion: the 'base case' is a size (and sometimes a type) of subproblem which can be handled or solved directly, without need of further recursion. The base cases cause recursion termination.

You can find a relevant, short description in our article about Recursion termination. For more detailed explanation please see the article about recursion in computer science, especially the Recursion (computer science) section.

Best regards, CiaPan (talk) 08:57, 6 July 2018 (UTC)