Sorting algorithms

There are no lectures regarding merge sort or quick sort??? And even after the counting sort, it was said implementation will be provided in the next lecture there is nothing so… Are the lectures missing??

@ritika_dhamija Hey Ritika, For merge sort and quick sort required knowledge of recursion. That’s why both sorting algorithm covered in the Recursion and BackTracking Section.

I hope I’ve cleared your doubt. Please mark this doubt as resolved and rate me on the basis of your experience. Rating option is just below where you mark this doubt as resolve. Your feedback is very important. It helps us to 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.

Okay thank thank you so much and for searching only binary search is discussed, and there are number of searching techniques, will those be discussed?
PS thanks for your quick response.

1 Like

@ritika_dhamija Hey Ritika, Algorithm and Data structure is wide topic. In this course mostly all the Important topic are covered. but we can’t discuss all the searching technique there are hell lot of technique. you can solve most of the problem with the help of binary Search. And as of my knowledge there is no other technique for sorted array better than this.