is i have to learn recursion before learning merge sort and quick sort?
Merge sort and quick sort
Hi @Chetan_Khandelwal
Both quicksort and mergesort algorithms can be implemented using both iterative as well as recursive approach. However their iterative approaches are a bit complicated and difficult to implement or remember. Which is why everyone simply uses the recursive approaches.
Neither of these algorithms uses any complicated recursion so if you understand basic recursion and how it works , you can understand and learn mergesort and quicksort easily.
Both of these have been covered in the online videos under the Recursion section.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.